Properties of the Number 20120

Twenty Thousand One Hundred Twenty

Basics

Value: 20119 → 20120 → 20121

Parity: even

Prime: No

Previous Prime: 20117

Next Prime: 20123

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 5 × 503

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 503, 1006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111010011000

Octal: 47230

Duodecimal: B788

Hexadecimal: 4e98

Square: 404814400

Square Root: 141.84498581197715

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

Multiples of 5 with digit sum 5. A69540

Numbers m having the same sum of divisors as m+20 has. A181647

Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0. A71153

a(n) is the concatenation of n and 6n. A9440

Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero. A71154

G.f. C(x) satisfies: C(x) = (1 - x²*C(x)²)*(1 - 2·x*C(x))/(1 - 3·x*C(x))³. A341966

a(n) = T(n, 2·n-8), T given by A027960. A27970

Łukasiewicz words that are also valid asynchronic siteswap juggling patterns. A71160

Concatenations x||1||x for numbers x. A392225

Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit). A71161