Properties of the Number 20870

Twenty Thousand Eight Hundred Seventy

Basics

Value: 20869 → 20870 → 20871

Parity: even

Prime: No

Previous Prime: 20857

Next Prime: 20873

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 2087

Divisors: 1, 2, 5, 10, 2087, 4174, 10435, 20870

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000110000110

Octal: 50606

Duodecimal: 100B2

Hexadecimal: 5186

Square: 435556900

Square Root: 144.46452851824907

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 planar partitions of n where parts strictly decrease along each row and column. A114736

Expansion of e.g.f.: log(1 + exp(x)*x). A9306

Number of square plane partitions of n. A89299

Number of meaningful differential operations of the n-th order on the space R¹⁰. A90995

a(n) = (1/2+1/2·i*sqrt(11))ⁿ + (1/2-1/2·i*sqrt(11))ⁿ, where i=sqrt(-1). A131040

a(n) = smallest positive integer that cannot be obtained using the number n at most n times and the operations +, -, *, /, where intermediate subexpressions must be integers. A71848

Number of length n 1..(1+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11. A254940

a(n) is the smallest divisor of triangular number T(n) := n(n+1)/2 not already in the sequence. A111273

G.f.: 1 / (1 + 6·x*G(x) - 7·x*G(x)²), where G(x) = 1 + x·G(x)³ is the g.f. of A001764. A226751

Number of strong single-component edge-subgraphs in Moebius ladder M_n. A20870