Properties of the Number 88551

Eighty-Eight Thousand Five Hundred Fifty-One

Basics

Value: 88550 → 88551 → 88552

Parity: odd

Prime: No

Previous Prime: 88547

Next Prime: 88589

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 9839

Divisors: 1, 3, 9, 9839, 29517, 88551

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101100111100111

Octal: 254747

Duodecimal: 432B3

Hexadecimal: 159e7

Square: 7841279601

Square Root: 297.5752005796182

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

Define a pair of sequences c_n, d_n by c₀=0, d₀=1 and thereafter c_n = c_n-1+d_n-1, d_n = c_n-1+4·n+2; sequence here is d_n. A192750

Number of (3+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. A250815

Number of n X 7 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299560

Number of n X n 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299555

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299561

Fibonacci winding number: the number of 'mod n' operations in one cycle of the Fibonacci sequence modulo n. A88551