Properties of the Number 90083

Ninety Thousand Eighty-Three

Basics

Value: 90082 → 90083 → 90084

Parity: odd

Prime: No

Previous Prime: 90073

Next Prime: 90089

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 17 × 757

Divisors: 1, 7, 17, 119, 757, 5299, 12869, 90083

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: 10101111111100011

Octal: 257743

Duodecimal: 4416B

Hexadecimal: 15fe3

Square: 8114946889

Square Root: 300.1383014545128

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

Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms. A2858

a(1)=2, a(2)=5; for n >= 3, a(n) is smallest number which is uniquely of the form a(j) + a(k) with 1 <= j < k < n. A7300

Maximal number of edges in a graceful graph on n nodes. A4137

Even pseudoprimes to base 9. A90083

Coefficients of the '6th-order' mock θ function φ(q). A53268

Coefficients of the '6th-order' mock θ function ψ(q). A53269

Expansion of f(-x, -x³) in powers of·where f(,) is Ramanujan's general θ function. A106459

Coefficients of the '6th-order' mock θ function ρ(q). A53270

Coefficients of the '6th-order' mock θ function γ(q). A53274

a(1) = 1, a(2) = 3; for n >= 3, a(n) is smallest number that is uniquely of the form a(j) + a(k) with 1 <= j < k < n. A2859