Properties of the Number 20588

Twenty Thousand Five Hundred Eighty-Eight

Basics

Value: 20587 → 20588 → 20589

Parity: even

Prime: No

Previous Prime: 20563

Next Prime: 20593

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5147

Divisors: 1, 2, 4, 5147, 10294, 20588

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101000001101100

Octal: 50154

Duodecimal: BAB8

Hexadecimal: 506c

Square: 423865744

Square Root: 143.48519087348353

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

T(n,k)=6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223467

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of parts of p. A241828

Number of tilings of a 20 X n rectangle using 2·n copies of the disconnected shape [ooooo_____ooooo]. A322473

Number of partitions of n into 10 or more distinct parts. A347577

Number of permutations of 1..n with number of rises (p(i+1)>p(i)) the same as number of rises in the inverse permutation. A180389

a(n) is the number of numbers k such that A340873(k) = n. A341218

Number of symmetric 5 X 5 matrices of nonnegative integers with zeros on the main diagonal and every row and column adding to n. A244868

Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere. A180319

6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX2 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223461

6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223463