141

1 + 4 + 1

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

Reads the same in both directions.

Leaves remainder 1 on division by 2.

Composite — it factors as 3 × 47.

2 distinct prime factors, 2 with multiplicity.

No prime divides it twice.

A product of exactly two primes, counted with multiplicity.

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

A gap of 10 between them.

1, 3, 47, 141

The proper divisors — everything except n itself.

Its proper divisors fall short by 90.

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.

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.

Not divisible by its digit sum 6.

Peaks at 424 along the way.