Properties of the Number 28978

Twenty-Eight Thousand Nine Hundred Seventy-Eight

Basics

Value: 28977 → 28978 → 28979

Parity: even

Prime: No

Previous Prime: 28961

Next Prime: 28979

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 2 × 14489

Divisors: 1, 2, 14489, 28978

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000100110010

Octal: 70462

Duodecimal: 1492A

Hexadecimal: 7132

Square: 839724484

Square Root: 170.2292571798397

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 partitions of 4n into 4 parts. A238340

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7. A252640

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise. A235818

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235577

Number of partitions of 5n into exactly 4 parts. A256327

a(1)=a(2)=1. a(n+1) = a(n) + a(smallest prime dividing n). A128216

Number of (n+1)X(1+1) 0..3 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235574

Number of partitions of 12·n into parts < 5. A191593

Number of 7X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 7 zero-sum 2-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192707

Number of (n+1)X(3+1) 0..3 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235576