Properties of the Number 20009

Twenty Thousand Nine

Basics

Value: 20008 → 20009 → 20010

Parity: odd

Prime: No

Previous Prime: 19997

Next Prime: 20011

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 11 × 17 × 107

Divisors: 1, 11, 17, 107, 187, 1177, 1819, 20009

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111000101001

Octal: 47051

Duodecimal: B6B5

Hexadecimal: 4e29

Square: 400360081

Square Root: 141.45317246354003

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

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} whose longest block is of length k (0<=k<=n). A184182

a(n) is the number of integer partitions of n for which the Kimberling index is equal to the index of the seaweed algebra formed by the integer partition paired with its weight. A318177

a(n) = ∑_i=0..n digsum(i)⁴, where digsum(i) = A007953(i). A231689

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2. A213070

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2. A214373

Numbers with digit sum 11 that are multiples of 11. A283742

Products of three distinct strong primes. A363782

Number of permutations of [n] whose longest block is of length 2. A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. A370390

Generalized Pellian with second term equal to 8. A48695