Properties of the Number 88338

Eighty-Eight Thousand Three Hundred Thirty-Eight

Basics

Value: 88337 → 88338 → 88339

Parity: even

Prime: No

Previous Prime: 88337

Next Prime: 88339

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 14723

Divisors: 1, 2, 3, 6, 14723, 29446, 44169, 88338

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101100100010010

Octal: 254422

Duodecimal: 43156

Hexadecimal: 15912

Square: 7803602244

Square Root: 297.21709237525357

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

Numbers k for which A064380(k) = k/2. A185078

Numbers k such that iphi(k) divides k, where iphi is the infinitary Euler φ function (A064380). A373057

Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7. A251889

Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 2 3 6 or 7. A252259

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers). A24592

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers). A25106

Numbers n such that frac(xⁿ)=frac(x·frac(x^n-1)) where x=3/2 and frac(x) denotes the fractional part of x. A88338