Properties of the Number 31323

Thirty-One Thousand Three Hundred Twenty-Three

Basics

Value: 31322 → 31323 → 31324

Parity: odd

Prime: No

Previous Prime: 31321

Next Prime: 31327

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 53 × 197

Divisors: 1, 3, 53, 159, 197, 591, 10441, 31323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101001011011

Octal: 75133

Duodecimal: 16163

Hexadecimal: 7a5b

Square: 981130329

Square Root: 176.98305003587208

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 balanced reduced multisystems whose atoms cover an initial interval of positive integers with multiplicities equal to the prime indices of n. A318846

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=3, a(1)=4, a(2)=5. A280308

Numbers p₁*p₂*...*p_k such that (2^p_1-1)*(2^p_2-1)*...*(2^p_k-1) is a Poulet number (A001567), where p_i are primes and k >= 2. A291617

Numerator(Bernoulli(2n)) mod denominator(Bernoulli(2n)). A169980

AbsoluteValue(Numerator(Bernoulli(2n))) mod denominator(Bernoulli(2n)). A180315

Least k such that base 10 representation of n begins at s(k), where s=A031312. A31323

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