Properties of the Number 31332

Thirty-One Thousand Three Hundred Thirty-Two

Basics

Value: 31331 → 31332 → 31333

Parity: even

Prime: No

Previous Prime: 31327

Next Prime: 31333

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 7 × 373

Divisors: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 111101001100100

Octal: 75144

Duodecimal: 16170

Hexadecimal: 7a64

Square: 981694224

Square Root: 177.00847437340394

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 subsets of {1..n} with a subset summing to n. A365376

a(n) = 4ⁿ * [xⁿ] ∏_k>=1 (1 + 3·x^k)^1/2. A370711

The number of partitions of n into parts, so that there exists a part i with multiplicity i. A392745

Position of n-th 7 in A031324. A31332

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