Properties of the Number 31132

Thirty-One Thousand One Hundred Thirty-Two

Basics

Value: 31131 → 31132 → 31133

Parity: even

Prime: No

Previous Prime: 31123

Next Prime: 31139

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 43 × 181

Divisors: 1, 2, 4, 43, 86, 172, 181, 362, 724, 7783

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100110011100

Octal: 74634

Duodecimal: 16024

Hexadecimal: 799c

Square: 969201424

Square Root: 176.44262523551387

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·A002294(x)). A186182

a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1). A77338

Numbers that require three steps to collapse to a single digit in base 4 (written in base 4). A253953

Number of integer partitions of n whose differences are an aperiodic word. A329137

Record differences between n-th prime and (n+2)-nd prime. A31132

Number of nX4 0..1 arrays with every element equal to 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero. A298135

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