Properties of the Number 20006

Twenty Thousand Six

Basics

Value: 20005 → 20006 → 20007

Parity: even

Prime: No

Previous Prime: 19997

Next Prime: 20011

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 1429

Divisors: 1, 2, 7, 14, 1429, 2858, 10003, 20006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100111000100110

Octal: 47046

Duodecimal: B6B2

Hexadecimal: 4e26

Square: 400240036

Square Root: 141.44256784999345

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

Number of partitions of n in which no parts are multiples of 5. A35959

List the positions of all digits '1' in the sequence. This is the lexicographically earliest increasing sequence with this property. A98645

Multiples of 7 in which there is no common digit in successive terms. A83495

Triangle read by rows: number of permutations of [1..n] with k progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0). A216716

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,4,0,2,1 for x=0,1,2,3,4. A196653

Coefficients in the expansion of ∏_m>=1 (1 - q^13·m)/(1 - q^m). A341714

Consider all integer triples (i,j,k), j,k>0, with i³=j³+binomial(k+2,3), ordered by increasing i; sequence gives k values. A54236

Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n. A90070

Binomial transform of A101910, where A101910(n) = a(A000120(n-1)) for n>0 with A101910(0) = 1. A101911

Numbers k such that k and k² use only the digits 0, 2, 3, 4 and 6. A136883