Properties of the Number 88113

Eighty-Eight Thousand One Hundred Thirteen

Basics

Value: 88112 → 88113 → 88114

Parity: odd

Prime: No

Previous Prime: 88093

Next Prime: 88117

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 23 × 1277

Divisors: 1, 3, 23, 69, 1277, 3831, 29371, 88113

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101100000110001

Octal: 254061

Duodecimal: 42BA9

Hexadecimal: 15831

Square: 7763900769

Square Root: 296.83833984173947

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) is the smallest number m such that for the n-digit number s=10^n-1+ m, 10·s+1, 10·s+3, 10·s+7 and 10·s+9 are primes. A97639

a(n) = N^1/4 * log(N) / sqrt(log(log(N))) rounded to nearest integer, with N=2ⁿ. Related to operation count of the deterministic factorization of an integer N using an improved Pollard-Strassen method. A309916

G.f.: A(x) = F(0,x) where F(0,x) = 1/(1 - x·F(1,x)), F(1,x) = 1/(1 - 4·x*F(2,x)²)^1/2, F(2,x) = 1/(1 - 9·x/F(3,x)³)^1/3, F(3,x) = 1/(1 - 16·x/F(4,x)⁴)^1/4, ..., so that F(n,x) = 1/(1 - (n+1)²*x·F(n+1,x)ⁿ⁺¹)^1/(n+1) for n>=0. A243195

a(n) = digit reversal of (11ⁿ) divided by 11. A88113