Properties of the Number 90036

Ninety Thousand Thirty-Six

Basics

Value: 90035 → 90036 → 90037

Parity: even

Prime: No

Previous Prime: 90031

Next Prime: 90053

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 41 × 61

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 41

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101111110110100

Octal: 257664

Duodecimal: 44130

Hexadecimal: 15fb4

Square: 8106481296

Square Root: 300.0599940011997

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

Number of ways to write n as an ordered sum of 8 nonprime numbers. A341485

a(n) is the number of regular hexagons with all six vertices (x,y,z) in the set {1,2,...,n}³. A338322

Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(1)x(2)... x(q) is the x(0)-th divisor of n. A234314

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

Length of shortest addition chain for n. A3313

Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners. A90036

Numbers that are simultaneously triangular and square pyramidal. A39596

Numbers such that 1+2+3...+a(n) = 1+4+9+...+r², for some r. A53612

Triangle read by rows: T(n, k) is the smallest m such that for every red-blue edge-coloring of the graph K_m there exists either a red n-cycle or a blue k-cycle; Ramsey number r(C_n, C_k). A389310

a(n) is the smallest m such that for every red-blue edge-coloring of the graph K_m there exists either a red or a blue n-cycle; Ramsey number r(C_n, C_n). A389313