Properties of the Number 31322

Thirty-One Thousand Three Hundred Twenty-Two

Basics

Value: 31321 → 31322 → 31323

Parity: even

Prime: No

Previous Prime: 31321

Next Prime: 31327

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 15661

Divisors: 1, 2, 15661, 31322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111101001011010

Octal: 75132

Duodecimal: 16162

Hexadecimal: 7a5a

Square: 981067684

Square Root: 176.98022488402484

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

Expansion of 1/(1 - x*∏_k>=1 (1 - k·x^k)). A299209

Counterclockwise square spiral constructed using the integers so that a(n) plus all other numbers currently visible from the current number equals n; start with a(0) = 0. A357985

Riordan array read by rows, corresponding to g.f. (1+x·y³)/((1-x-y)*(1+x·y³)+x·y⁴). A239102

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 465", based on the 5-celled von Neumann neighborhood. A272316

Position of n-th 9 in A031312. A31322

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