110

1 + 1 + 0

Digit sum repeated until one digit remains; equals n mod 9 (with 9 for multiples of 9).

Reverses to 11.

Divisible by 2.

Composite — it factors as 2 × 5 × 11.

3 distinct prime factors, 3 with multiplicity.

No prime divides it twice.

(−1) to the power of 3 distinct prime factors.

A gap of 4 between them.

1, 2, 5, 10, 11, 22, 55, 110

The proper divisors — everything except n itself.

Its proper divisors fall short by 4.

How many integers from 1 to n share no factor with n.

A prime congruent to 3 mod 4 divides it an odd number of times, which rules it out.

Legendre's three-square theorem allows it.

Lagrange's four-square theorem: every non-negative integer is, without exception.

The smallest pair of primes summing to n. Goldbach’s conjecture says one always exists; it remains unproven.

Not triangular, square, pentagonal, hexagonal, cubic, Fibonacci, Lucas, Catalan, factorial or a power of two.

Summing the squares of its digits falls into the 4 → 16 → 37 → … → 4 cycle.

Divisible by its digit sum 2 — 110 ÷ 2 = 55.

Peaks at 9,232 along the way.