Properties of the Number 20321

Twenty Thousand Three Hundred Twenty-One

Basics

Value: 20320 → 20321 → 20322

Parity: odd

Prime: No

Previous Prime: 20297

Next Prime: 20323

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 7 × 2903

Divisors: 1, 7, 2903, 20321

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111101100001

Octal: 47541

Duodecimal: B915

Hexadecimal: 4f61

Square: 412943041

Square Root: 142.55174499107332

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 numbers in row n of the array at A243925. A243927

Expansion of the Jacobi elliptic function cn(x,k) at k = 2 (even powers only). A370543

G.f. satisfies: A(x) = ∑_n>=0 xⁿ * ∑_k=0..n x^k * {[x^k] A(x)^4·n}. A249937

Where records appear in A109734. A109740

Number of (w,x,y) with all terms in {0,...,n} and 2∣w-x| >= max(w,x,y)-min(w,x,y). A213388

G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x²)*A(x³)*A(x⁵)* ... *A(x^prime(k))* ... A308271

Numbers k such that both k and k+2 are de Polignac numbers (A006285). A330284

Number of minimal edge cuts in the n-antiprism graph. A378922

Number of times n occurs in the sequence floor(log_Pi(i)) with i=1,2,3,... . A247168

If the base-4 expansion of n starts with the digit 1, then replace 2's by 3's and vice versa; if it starts with the digit 2, then replace 1's by 3's and vice versa; if it starts with the digit 3, then replace 1's by 2's and vice versa; a(0) = 0. A361946