Properties of the Number 21322

Twenty-One Thousand Three Hundred Twenty-Two

Basics

Value: 21321 → 21322 → 21323

Parity: even

Prime: No

Previous Prime: 21319

Next Prime: 21323

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 1523

Divisors: 1, 2, 7, 14, 1523, 3046, 10661, 21322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001101001010

Octal: 51512

Duodecimal: 1040A

Hexadecimal: 534a

Square: 454627684

Square Root: 146.0205464994567

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) = 1 + 2·n² + 3·n³ + 4·n⁴ +5·n⁵ + 6·n⁶ + 7·n⁷. A209265

a(n) is the total multiplicity of all products of Schur functions s(λ)*s(μ) with size(λ) + size(μ) = n. A296626

a(n) = number of partitions of n whose difference multiset has at least one duplicate; see Comments. A364612

a(n) is the number of primes between (prime(n))³ and (prime(n+1))³. A365767

Number of weakly alternating ordered prime factorizations of n with at least two adjacent equal parts. A349798

Decimal expansion of 1/318. A21322

The number of ways to color n balls in a row with 3 colors with no color runs having lengths greater than 4. This sequence is a special case of the general problem for coloring n balls in a row with p colors where each color has a given maximum run-length. In this example, the bounds are uniformly 4. It can be phrased in terms of tossing a p-faced die n times, requiring each face to have no runs longer than b. A181140