Properties of the Number 31222

Thirty-One Thousand Two Hundred Twenty-Two

Basics

Value: 31221 → 31222 → 31223

Parity: even

Prime: No

Previous Prime: 31219

Next Prime: 31223

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 67 × 233

Divisors: 1, 2, 67, 134, 233, 466, 15611, 31222

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100111110110

Octal: 74766

Duodecimal: 1609A

Hexadecimal: 79f6

Square: 974813284

Square Root: 176.69748158929713

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

T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222488

Start of n-th segment of Recamán's sequence R(m) (A005132): values of n where the change in the fractional parts of successive values of R(n)/n is positive. A64492

Row 6 of array in A047666. A47670

Number of binary strings of length n with no substrings equal to 0001, 0100, or 1110. A164468

Number of 3Xn 0..2 arrays with exactly floor(3Xn/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222490

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (-1, 1), (0, -1), (1, 0), (1, 1)}. A151450

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

Position of n-th 2 in A031219. A31222

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

Number of compositions of n such that between any pair of equal adjacent parts there can be a pair of brackets enclosing a new nonempty composition with the same rules. A383765