Properties of the Number 90097

Ninety Thousand Ninety-Seven

Basics

Value: 90096 → 90097 → 90098

Parity: odd

Prime: No

Previous Prime: 90089

Next Prime: 90107

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 61 × 211

Divisors: 1, 7, 61, 211, 427, 1477, 12871, 90097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101111111110001

Octal: 257761

Duodecimal: 44181

Hexadecimal: 15ff1

Square: 8117469409

Square Root: 300.16162312993976

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

Apply partial sum operator twice to sequence of squares of the first n primes. A157492

Products p·q*r of three distinct primes such that s=(p·q) mod r, t=(p·r) mod q and u=(q·r) mod p, and s+t+u are all prime. A338705

Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle. A1263

a(n) = (3ⁿ + 1)/2. A7051

Number of order-consecutive partitions of n. A7052

a(n) = (3·n-1) * 2^n-2. A53220

Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n). A56242

Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n). A56241

Bases n such that the smallest prime-power-pseudoprime to base n is 9. A90097

Third diagonal of triangle A056242. A56243