Properties of the Number 90321

Ninety Thousand Three Hundred Twenty-One

Basics

Value: 90320 → 90321 → 90322

Parity: odd

Prime: No

Previous Prime: 90313

Next Prime: 90353

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 × 17 × 23

Divisors: 1, 3, 7, 11, 17, 21, 23, 33, 51, 69

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110000011010001

Octal: 260321

Duodecimal: 44329

Hexadecimal: 160d1

Square: 8157883041

Square Root: 300.53452380716595

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

a(n) = n*(n + 1)*(5·n - 4)/2. A237616

Partial sums of A007587. A51799

Numbers that have exactly 7 representations as a k-gonal number, P(m,k) = m*((k-2)*m - (k-4))/2, k and m >= 3. A321157

Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers. A178782

9-gonal numbers which are products of five distinct primes. A356355

a(n) = 2*(3·n)! / ((2·n+1)!*(n+1)!). A139

Related to sorting procedure studied by West: number of permutations that are both sorted (i.e., obtainable as output of the sorting procedure) and one-stack sortable. A27432

T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows. A90321

Number of standard Young tableaux of n cells and height <= 12. A229068

Number of "sorted permutations": permutations that can occur as the output of the sorting procedure described by Knuth. A27361