Properties of the Number 90135

Ninety Thousand One Hundred Thirty-Five

Basics

Value: 90134 → 90135 → 90136

Parity: odd

Prime: No

Previous Prime: 90127

Next Prime: 90149

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 2003

Divisors: 1, 3, 5, 9, 15, 45, 2003, 6009, 10015, 18027

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000000010111

Octal: 260027

Duodecimal: 441B3

Hexadecimal: 16017

Square: 8124318225

Square Root: 300.224915688222

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 arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1 or 2 with sum zero. A193641

8th-power analog of Keith numbers. A281919

G.f. satisfies: A(x) = ∑_n>=0 xⁿ * A(x)^n*(n+1/2) / ∏_k=1..n (1 + x·A(x)^k). A221586

Numbers that can be written in exactly two different ways in the form described by A387302. A387898

Number of runs in binary expansion of n (n>0); number of 1's in Gray code for n. A5811

a(n) = a(floor(n/2)) + n; also denominators in expansion of 1/sqrt(1-x) are 2^a(n); also 2n - number of 1's in binary expansion of 2n. A5187

a(n) = n minus (number of 1's in binary expansion of n). Also highest power of 2 dividing n!. A11371

Values of the genus g for which there exists a compact Riemann surface of genus g admitting an automorphism group of order 84(g-1), the maximum possible, also known as the Hurwitz bound. A179982

(1/2)*(n minus number of runs in the binary expansion of n): a(n) = (n - A005811(n)) / 2 = A236840(n)/2. A255070

Number of rooted trees with n nodes and ω-valency 1. A3120