Properties of the Number 10888

Ten Thousand Eight Hundred Eighty-Eight

Basics

Value: 10887 → 10888 → 10889

Parity: even

Prime: No

Previous Prime: 10883

Next Prime: 10889

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 1361

Divisors: 1, 2, 4, 8, 1361, 2722, 5444, 10888

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101010001000

Octal: 25210

Duodecimal: 6374

Hexadecimal: 2a88

Square: 118548544

Square Root: 104.34557968596465

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

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = ∑_k>=0 y^k * R_k(y)^n·k for n>=0, with R₀(y) = 1/(1-y). A124530

Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A261781

Smallest positive number using exactly n segments on a calculator display (when '6' and '7' are represented using 6 resp. 3 segments). A216261

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237234

Numbers n such that n is a substring of its square in base 5 (written in base 10). A18829

Sum of the squarefree parts of the partitions of n into 6 parts. A309481

Row 3 of rectangular table A124530. A124533

Where record values occur in A010371. A143617

Smallest positive number that needs more lines when shown on a 7-segment display (digital clock) than any previous term. A38619

Number of ways to choose three distinct points from a 5 X n grid so that they form an isosceles triangle. A271915