Properties of the Number 606

Six Hundred Six

Basics

Value: 605 → 606 → 607

Parity: even

Prime: No

Previous Prime: 601

Next Prime: 607

Digit Sum: 12

Digital Root: 3

Palindrome: Yes

Factorization: 2 × 3 × 101

Divisors: 1, 2, 3, 6, 101, 202, 303, 606

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001011110

Octal: 1136

Duodecimal: 426

Hexadecimal: 25e

Square: 367236

Square Root: 24.61706725018234

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Triangle read by rows: T(n,k) = ∑_j>=0 j!*T(n-j-1, k-1) for n >= 0, k >= 0. A84938

Dispersion of (3+[n·r]), where r=(golden ratio)=(1+sqrt(5))/2 and [ ]=floor, by antidiagonals. A191426

11-gonal (or hendecagonal) numbers: a(n) = n*(9·n-7)/2. A51682

Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor. A91191

Number of integer partitions of n such that it is possible to choose a different prime factor of each part. A370592

Generalized 11-gonal (or hendecagonal) numbers: m*(9·m - 7)/2 with m = 0, 1, -1, 2, -2, 3, -3, ... A195160

Number of set partitions of strict integer partitions of n that have distinct block-sums. A279375

Admirable numbers. A number n is admirable if there exists a proper divisor d' of n such that σ(n)-2d'=2n, where σ(n) is the sum of all divisors of n. A111592

Unitary abundant numbers: numbers k such that usigma(k) > 2·k. A34683

Cyclops numbers. A134808