ℕ atory
Play Now

Properties of the Number 20110

Twenty Thousand One Hundred Ten

Basics

Value: 20109 → 20110 → 20111

Parity: even

Prime: No

Previous Prime: 20107

Next Prime: 20113

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 2011

Divisors: 1, 2, 5, 10, 2011, 4022, 10055, 20110

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111010001110

Octal: 47216

Duodecimal: B77A

Hexadecimal: 4e8e

Square: 404412100

Square Root: 141.8097316829843

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 integer partitions of n having at most one permutation with all equal run-lengths. A383092
Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers. A169822
Full Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171). A79436
Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood. A283182
Number of rooted trees with n nodes and 3 leaves. A55278
Inverse Euler transform of 2 - A195981. A206000
Write A003512(n) in the base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} (see A002530). A276387
Write n in the P-base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} corresponding to (1+sqrt(3))/2 (see A002530). A276388
List of binary words of lengths 0, 1, 2, etc., including empty word, each prefixed by a 2. A319953
Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4). A352751