Properties of the Number 20010

Twenty Thousand Ten

Basics

Value: 20009 → 20010 → 20011

Parity: even

Prime: No

Previous Prime: 19997

Next Prime: 20011

Digit Sum: 3

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 23 × 29

Divisors: 1, 2, 3, 5, 6, 10, 15, 23, 29, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111000101010

Octal: 47052

Duodecimal: B6B6

Hexadecimal: 4e2a

Square: 400400100

Square Root: 141.45670715805596

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

Numbers whose sum of digits is 3. A52217

Expansion of (∏_j>=1 (1-(-x)^j) - 1)¹⁰ in powers of x. A1488

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10. A135195

Numbers k such that the average digit of k² is 1. A164771

Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k). A69522

Concatenate the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the leftmost digit etc., and 0 when the digit does not occur. A260522

Numbers k such that 3 and 5 do not divide binomial(2·k, k). A129508

Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n). A88003

a(n) is the minimal values of A007947((2ⁿ)*m*(2ⁿ-m)). A143702

Product of n and the sum of all divisors of all positive integers <= n. A256533