Properties of the Number 31097

Thirty-One Thousand Ninety-Seven

Basics

Value: 31096 → 31097 → 31098

Parity: odd

Prime: No

Previous Prime: 31091

Next Prime: 31121

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 ² × 257

Divisors: 1, 11, 121, 257, 2827, 31097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100101111001

Octal: 74571

Duodecimal: 15BB5

Hexadecimal: 7979

Square: 967023409

Square Root: 176.34341496069538

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

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Lucas numbers). A24319

Expansion of ∏_k>=1 (1 + x^k)^φ(k), where φ() is the Euler totient function (A000010). A299069

a(n) = 46·n² + 1. A158632

Numbers n such that prime(n) + reversal(prime(n)) is a square. A227371

Number of Motzkin paths of length n with no peaks at level 3. A257104

Number of n X 7 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 7 array. A220031

a(n) = ∑_{p in P} (H(2,p)²)/2, where P is the set of partitions of n, and H(2,p) is the number of hooks of length 2 in p. A302348

Fibonacci sequence beginning 4, 17. A22134

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (Lucas numbers). A24882

Numbers k such that, taken together, the base-10 and base-b expansions of k are pandigital for some b < 10. A174596