ℕ atory
Play Now

Properties of the Number 28654

Twenty-Eight Thousand Six Hundred Fifty-Four

Basics

Value: 28653 → 28654 → 28655

Parity: even

Prime: No

Previous Prime: 28649

Next Prime: 28657

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 14327

Divisors: 1, 2, 14327, 28654

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111111101110

Octal: 67756

Duodecimal: 146BA

Hexadecimal: 6fee

Square: 821051716

Square Root: 169.27492430953853

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

a(n) = Fibonacci(n) - 3. Number of total preorders. A6327
T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240284
Number of length n left factors of Dyck paths having no base pyramids. A191789
a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,1,1,0. A25274
Site percolation series for Kagome lattice. A120549
Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,1,1. A222436
Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240282
Number of 4Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240287
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (-1, 1, 1), (1, -1, 0), (1, 0, 0)}. A148276
a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)). A270741