Properties of the Number 28962

Twenty-Eight Thousand Nine Hundred Sixty-Two

Basics

Value: 28961 → 28962 → 28963

Parity: even

Prime: No

Previous Prime: 28961

Next Prime: 28979

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1609

Divisors: 1, 2, 3, 6, 9, 18, 1609, 3218, 4827, 9654

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000100100010

Octal: 70442

Duodecimal: 14916

Hexadecimal: 7122

Square: 838797444

Square Root: 170.182255244194

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) = Number of (n+1) X (k+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise. A235449

Expansion of 1 + ∑_n>=1 (x^n² / ∏_k>=n (1 - x^k)). A188216

Expansion of ∏_k>=1 B(x^k), where B(x) is the g.f. of A003106. A327691

a(n) = n·a(n-1) - n + 2 for n > 1; a(1)=1. A94294

Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed. A228964

Expansion of ∏_k>=0 1/(1-x^5·k+4)^5·k+4. A285132

Number of (n+1) X (3+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise. A235444

a(n) = ∑_k=1..n (-1)^k+1 * floor(n/(2·k-1))³. A350163

Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise. A235442

Numbers represented by quadratic form with Gram matrix [ 2, 1, 0; 1, 3, 1; 0, 1, 5 ]. A28962