Properties of the Number 90002

Ninety Thousand Two

Basics

Value: 90001 → 90002 → 90003

Parity: even

Prime: No

Previous Prime: 90001

Next Prime: 90007

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 11 × 4091

Divisors: 1, 2, 11, 22, 4091, 8182, 45001, 90002

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111110010010

Octal: 257622

Duodecimal: 44102

Hexadecimal: 15f92

Square: 8100360004

Square Root: 300.003333314815

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

Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m·n-m·k+1)*T(n-1,k-1) + (m·k-m+1)*T(n-1,k), where m = 7. A142462

Numbers k such that k*(k+7) is a palindrome. A28564

The multiplicative partition function: number of ways of factoring n with all factors greater than 1 (a(1) = 1 by convention). A1055

Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250). A111

Dedekind numbers or Dedekind's problem: number of monotone Boolean functions of n variables, number of antichains of subsets of an n-set, number of elements in a free distributive lattice on n generators, number of Sperner families. A372

Number of partitions of n with a product <=n. A96276

Number of square permutations of n elements. A3483

Number of rooted maps with n edges on torus. A6300

T(n,k) = ∑_d∣k φ(d)*n^k/d/k, triangle read by rows, T(n,k) for n >= 1 and 1 <= k <= n. A54630

Length of longest contiguous block of 1's in binary expansion of n-th triangular number. A90002