Properties of the Number 31233

Thirty-One Thousand Two Hundred Thirty-Three

Basics

Value: 31232 → 31233 → 31234

Parity: odd

Prime: No

Previous Prime: 31231

Next Prime: 31237

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 29 × 359

Divisors: 1, 3, 29, 87, 359, 1077, 10411, 31233

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101000000001

Octal: 75001

Duodecimal: 160A9

Hexadecimal: 7a01

Square: 975500289

Square Root: 176.7286054944134

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

The fourth row of the ED3 array A167572. A167574

Triangle of coefficients of polynomials v(n,x) jointly generated with A210747; see the Formula section. A210748

Indices of primes in sequence defined by A(0) = 11, A(n) = 10·A(n-1) + 71 for n > 0. A56249

a(n) = (n⁴ - n³ + 4·n² + 2)/2. A239592

Replacing each digit d in decimal expansion of n with d² yields a prime at each step when done recursively three times. A316604

The ED3 array read by antidiagonals. A167572

(# 2's)-(# 3's) in first n terms of A031219. A31233

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