Properties of the Number 20111

Twenty Thousand One Hundred Eleven

Basics

Value: 20110 → 20111 → 20112

Parity: odd

Prime: No

Previous Prime: 20107

Next Prime: 20113

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 7 × 13 ² × 17

Divisors: 1, 7, 13, 17, 91, 119, 169, 221, 1183, 1547

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111010001111

Octal: 47217

Duodecimal: B77B

Hexadecimal: 4e8f

Square: 404452321

Square Root: 141.81325749026428

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

Ł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

Ternary numbers that are concatenated runs C(1)B(1)A(1)C(2)B(2)A(2)...C(k)B(k)A(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k. A371109

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

"Lazy binary" representation of n. Also called redundant binary representation of n. A89591

Numbers k such that σ(k) = ψ(k) + τ(k)². A390296

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

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood. A279470

Expansion of ∏_k>=1 1/(1 - k·x^k²)^k. A285243

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

Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments. A172360