Properties of the Number 88913

Eighty-Eight Thousand Nine Hundred Thirteen

Basics

Value: 88912 → 88913 → 88914

Parity: odd

Prime: No

Previous Prime: 88903

Next Prime: 88919

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 11 × 59 × 137

Divisors: 1, 11, 59, 137, 649, 1507, 8083, 88913

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101101101010001

Octal: 255521

Duodecimal: 43555

Hexadecimal: 15b51

Square: 7905521569

Square Root: 298.18282982090034

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

Square array read by diagonals: T(n,k) = number of arrays of n integers in -k..k with sum equal to 0. A201552

Number of ordered solutions to x+y+z = u+v+w, 0 <= x, y, z, u, v, w < n. A71816

Number of arrays of n integers in -5..5 with sum zero. A201549

Number of arrays of 6 integers in -n..n with sum zero. A201553

Composite squarefree numbers n such that p(i)-7 divides n+7, where p(i) are the prime factors of n. A225707

Expansion of ∏_k>=1 1/((1 - x^k)*(1 - x^3·k)). A318026

a(n) = (Lucas(2n) + Lucas(2n+1)*φ)/κ(φ/Fibonacci(4n)) where κ(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x). A88913

Array A(k,n) of the number of points of the A_k lattice with maximum infinity norm n, read by antidiagonals. A175197