Properties of the Number 90008

Ninety Thousand Eight

Basics

Value: 90007 → 90008 → 90009

Parity: even

Prime: No

Previous Prime: 90007

Next Prime: 90011

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 11251

Divisors: 1, 2, 4, 8, 11251, 22502, 45004, 90008

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101111110011000

Octal: 257630

Duodecimal: 44108

Hexadecimal: 15f98

Square: 8101440064

Square Root: 300.0133330370502

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 such that the least term in the periodic part of the continued fraction for sqrt(k) is 75. A31753

Length of shortest addition chain for n. A3313

Triangular array T(h,k) for 0 <= k <= h read by rows: T(h,k) = number of binary Lyndon words with k ones and h-k zeros. A51168

a(n) = 2^2ⁿ - 1. A51179

Number of rooted planar trees with n non-root nodes: circularly cycling the subtrees at the root gives equivalent trees. A3239

Triangle read by rows: T(n,k) is the (n,k)-th circular binomial coefficient, where 0 <= k <= n. A47996

Triangular array giving Ramanujan sum T(n,k) = c_n(k) = ∑_{m=1..n, (m,n)=1} exp(2 π i m k / n) for n >= 1 and 1 <= k <= n. A54533

Number of different score sequences that are possible in an n-team round-robin tournament. A571

Number of solutions to Langford (or Langford-Skolem) problem (up to reversal of the order). A14552

Array read by upward antidiagonals: T(n,k) (n >= 0, k >= 0) = nim k-th power of n. A335162