Properties of the Number 90120

Ninety Thousand One Hundred Twenty

Basics

Value: 90119 → 90120 → 90121

Parity: even

Prime: No

Previous Prime: 90107

Next Prime: 90121

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 751

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000000001000

Octal: 260010

Duodecimal: 441A0

Hexadecimal: 16008

Square: 8121614400

Square Root: 300.19993337774076

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

Base-11 Armstrong or narcissistic numbers (written in base 10). A161948

G.f. A(x) satisfies A(x) = ∏_k>=1 (1 - x^k*A(x)). A298261

Maximum number of inequivalent permutations of a partition of n, where two permutations are equivalent if they are reversals of each other. A361223

Number of nodes of odd outdegree in all ordered rooted (planar) trees with n edges. A14300

a(n) = ((3·n+1)*2ⁿ - (-1)ⁿ)/9. A45883

Numbers k such that nextprime(k²) - prevprime(k²) = 4. A90120

Triangle read by rows: T(n,k) (0 <= k <= n) arises from the chain algorithm for the "Just"- or J-version of the n-coin group testing game. A241184

Triangle read by rows: T(n,k) (0 <= k <= n) arises from the star algorithm for the "Just"- or J-version of the n-coin group testing game. A241185