Properties of the Number 20580

Twenty Thousand Five Hundred Eighty

Basics

Value: 20579 → 20580 → 20581

Parity: even

Prime: No

Previous Prime: 20563

Next Prime: 20593

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 7 ³

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000001100100

Octal: 50144

Duodecimal: BAB0

Hexadecimal: 5064

Square: 423536400

Square Root: 143.45731072343438

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

Heinz numbers of supernormal integer partitions. A317246

Numbers k such that the set of prime divisors of k is equal to the set of prime divisors of σ(k). A27598

a(n) = n*(2·n² -3·n +7)/6 = C(n, 1) + C(n, 2) + 2·C(n, 3). A81489

Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] δ [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where δ is the operator defined in A084938. A89949

a(n) = n*(n - 1)³/2. A19582

Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles. A57096

Number of partitions of n where there are k²+1 kinds of parts k. A363602

Number of 3-voter voting schemes with n linearly ranked choices. A7009

a(n) = C(2n-1,n-1) mod n³. A99907

Number of 7-element ordered T₀-antichains on an unlabeled n-set; T₁-hypergraphs on 7 labeled nodes with n (not necessarily empty) distinct hyperedges (n=0,1,...,128). A59050