Properties of the Number 28060

Twenty-Eight Thousand Sixty

Basics

Value: 28059 → 28060 → 28061

Parity: even

Prime: No

Previous Prime: 28057

Next Prime: 28069

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5 × 23 × 61

Divisors: 1, 2, 4, 5, 10, 20, 23, 46, 61, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110110011100

Octal: 66634

Duodecimal: 142A4

Hexadecimal: 6d9c

Square: 787363600

Square Root: 167.51119365582707

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)=4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..9 arrays where 0..9 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223415

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2 X 2 subblock. A236096

Array read by antidiagonals: T(n,m) = number of Hamiltonian cycles in C_n X C_m. A270273

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its king-move neighbors, with the exception of exactly two elements. A282593

Sum of n-th antidiagonal of A082191. A82195

Number of Hamiltonian cycles in C₄ X C_n. A216588

4 X 4 X 4 triangular graph without horizontal edges coloring a rectangular array: number of n X 2 0..9 arrays where 0..9 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223409

4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nX5 0..9 arrays where 0..9 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223412

Number of (n+1)X(1+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2X2 subblock. A236089

Number of (n+1)X(5+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2X2 subblock. A236093