Properties of the Number 28456

Twenty-Eight Thousand Four Hundred Fifty-Six

Basics

Value: 28455 → 28456 → 28457

Parity: even

Prime: No

Previous Prime: 28447

Next Prime: 28463

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 3557

Divisors: 1, 2, 4, 8, 3557, 7114, 14228, 28456

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110111100101000

Octal: 67450

Duodecimal: 14574

Hexadecimal: 6f28

Square: 809743936

Square Root: 168.68906307167634

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..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250632

Multiply a(n-1) by 2 and drop all 0's. A242350

Numbers n > 1 such that n⁵ - 2 has no prime factor > n. A83955

Related to Gray codes: see Comments lines. A91969

Column 3 of A142249. A293561

Expansion of (1-x-2·x²) / (1-2·x-4·x²+2·x³). A384677

a(n) = (n/2) * (n³ - 2·n² - 2·n + 5). A242983

Number of (n+1)X(6+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250630

Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250633

Least integer k such that A001358(k) + A001358(k+1) is the product of exactly n prime factors (counting multiplicity). A288517