ℕ atory
Play Now

Properties of the Number 31888

Thirty-One Thousand Eight Hundred Eighty-Eight

Basics

Value: 31887 → 31888 → 31889

Parity: even

Prime: No

Previous Prime: 31883

Next Prime: 31891

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 4 × 1993

Divisors: 1, 2, 4, 8, 16, 1993, 3986, 7972, 15944, 31888

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110010010000

Octal: 76220

Duodecimal: 16554

Hexadecimal: 7c90

Square: 1016844544

Square Root: 178.5721142843977

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,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171307
T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array. A220461
T(n,k)=Number of n-turn queen's tours on a kXk board summed over all starting positions. A186965
Number of 0..n-1 integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5. A171357
Number of 0..5 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171311
Equals one maps: number of nX2 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nX2 array. A220456
Number of 3-turn queen's tours on an n X n board summed over all starting positions. A186966
Number of 2-face-free maps on n edges. A220899
Lucky numbers with size of gaps equal to 6 (lower terms). A31888
G.f. satisfies: A(x) = ∑n>=0 An(x) * A(x)n where An+1(x) = An(A(x)) denotes iteration with A0(x)=x and A'(0)=1. A180256