Properties of the Number 31159

Thirty-One Thousand One Hundred Fifty-Nine

Basics

Value: 31158 → 31159 → 31160

Parity: odd

Prime: Yes

Previous Prime: 31153

Next Prime: 31177

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 31159

Divisors: 1, 31159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100110110111

Octal: 74667

Duodecimal: 16047

Hexadecimal: 79b7

Square: 970883281

Square Root: 176.5191207773254

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

Middle of 3 consecutive prime numbers such that p1·p2·p3 + d1 + d2 - 1 = average of twin prime pairs, d1 (δ) = p2 - p1, d2 (δ) = p3 - p2. A153404

a(n) is the n-th prime whose decimal expansion begins with the decimal expansion of n. A77345

a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed). A62065

Primes p such that (p²⁵⁶ + 1)/2 is prime. A341234

Join 2n points on a line with n arcs above the line; form graph with the arcs as nodes, joining 2 nodes when the arcs cross. a(n) is the number of cases in which the graph is a path. A8909

Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5). A39904

a(n) = ∑_{k=0..floor(n/8)} binomial(n-5·k, 3·k). A113032

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

Twin lucky numbers (upper terms). A31159