Properties of the Number 31390

Thirty-One Thousand Three Hundred Ninety

Basics

Value: 31389 → 31390 → 31391

Parity: even

Prime: No

Previous Prime: 31387

Next Prime: 31391

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 43 × 73

Divisors: 1, 2, 5, 10, 43, 73, 86, 146, 215, 365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101010011110

Octal: 75236

Duodecimal: 161BA

Hexadecimal: 7a9e

Square: 985332100

Square Root: 177.17223258738937

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 (1,0) steps in all Grand Motzkin paths of length n. A109188

Expansion of x/((1 - x - x⁴)*(1 - x)²). A145131

Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)). A132885

Numbers k such that k² has digits in nonincreasing order. A28821

Number of 0..n arrays x(0..11) of 12 elements with zero 6th differences. A200374

Number of nX7 0..1 arrays with every element unequal to 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero. A304301

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero. A304302

a(n) = prime(9·n - 3). A31390

Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101. A259949