Properties of the Number 21304

Twenty-One Thousand Three Hundred Four

Basics

Value: 21303 → 21304 → 21305

Parity: even

Prime: No

Previous Prime: 21283

Next Prime: 21313

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 2663

Divisors: 1, 2, 4, 8, 2663, 5326, 10652, 21304

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001100111000

Octal: 51470

Duodecimal: 103B4

Hexadecimal: 5338

Square: 453860416

Square Root: 145.9588983241515

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 permutations P of {1,2,...,n} such that P(1)=1 and |P^-1(i+1)-P^-1(i)| equals 1 or 2 for i=1,2,...,n-1. A38718

Numbers whose digits are a permutation of [0,...,n] and which contain the product of any two adjacent digits as a substring. A203569

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal maximum nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A254390

a(n) is the smallest b > 1 such that p = prime(n) satisfies b^p-1 == 1 (mod p³). A249275

Number of polyhexes with n cells that tile the plane by translation or by 180-degree rotation (Conway criterion). A75212

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal maximum nondecreasing horizontally and vertically. A253985

Number of Catalan objects fixed by two-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees). A79223

a(n) is the smallest k such that (k³ + 1)/(n³ + 1) is an integer > 1. A65964

Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the two-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees). A79218

Sum of largest parts (counted with multiplicity) in all compositions of n. A97976