ℕ atory
Play Now

Properties of the Number 90035

Ninety Thousand Thirty-Five

Basics

Value: 90034 → 90035 → 90036

Parity: odd

Prime: No

Previous Prime: 90031

Next Prime: 90053

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 11 × 1637

Divisors: 1, 5, 11, 55, 1637, 8185, 18007, 90035

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: 10101111110110011

Octal: 257663

Duodecimal: 4412B

Hexadecimal: 15fb3

Square: 8106301225

Square Root: 300.0583276631395

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 Dyck paths of length 2n with nondecreasing peaks. A48285
Numbers n such that the difference between the greatest prime divisor of n3 + 1 and the sum of the other distinct prime divisors is equal to +-1. A243609
Tangent (or "Zag") numbers: e.g.f. tan(x), also (up to signs) e.g.f. tanh(x). A182
Triangle T(n,k): T(n,k) = μ(n/k) if k divides n, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n). A54525
The number of pairs of permutations in the product group Sn X Sn with k common descents, n >= 1 and 0 <= k <= n-1. A192721
Number of configurations of the 4 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. A90035
Triangle read by rows: T(n,k) is the sum of the weights of all vertices labeled k at depth n in the Catalan tree (1 <= k <= n+1, n >= 0). A102625
Triangle read by rows: T(n, k) is the smallest m such that for every red-blue edge-coloring of the graph Km there exists either a red n-cycle or a blue k-cycle; Ramsey number r(Cn, Ck). A389310
a(n) is the smallest m such that for every red-blue edge-coloring of the graph Km there exists either a red or a blue n-cycle; Ramsey number r(Cn, Cn). A389313
Maximal size of an n-distance set in the plane. A131628