Properties of the Number 31072

Thirty-One Thousand Seventy-Two

Basics

Value: 31071 → 31072 → 31073

Parity: even

Prime: No

Previous Prime: 31069

Next Prime: 31079

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 971

Divisors: 1, 2, 4, 8, 16, 32, 971, 1942, 3884, 7768

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100101100000

Octal: 74540

Duodecimal: 15B94

Hexadecimal: 7960

Square: 965469184

Square Root: 176.27251629224563

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

Triangle read by rows: the almost-Riordan array ( 1/(1-x) | 2/((1-x)*(1+x+sqrt(5·x²-6·x+1))), (1-3·x-sqrt(5·x²-6·x+1))/(2x) ). A373746

Monotonic ordering of nonnegative differences 2ⁱ-10^j, for 40>= i>=0, j>=0. A192124

Number of connected dominating sets in the n-triangular graph. A298104

a(n) = 2ⁿ*(4·3ⁿ-1). A321003

Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes. A64962

Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n. A181664

Total sum of parts of multiplicity 3 in all partitions of n. A222731

Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions. A187288

Distance of closest integer power of 10 to the n-th power of 2. A334588

Number of {2,3}-regular graphs; i.e., labeled simple graphs (no multi-edges or loops) on n vertices, each of degree 2 or 3. A110040