Properties of the Number 31972

Thirty-One Thousand Nine Hundred Seventy-Two

Basics

Value: 31971 → 31972 → 31973

Parity: even

Prime: No

Previous Prime: 31963

Next Prime: 31973

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7993

Divisors: 1, 2, 4, 7993, 15986, 31972

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110011100100

Octal: 76344

Duodecimal: 16604

Hexadecimal: 7ce4

Square: 1022208784

Square Root: 178.80715869338118

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

Numerator of the barycenter of first n primes defined as a(n) = numerator(∑_i=1..n (i·prime(i)) / ∑_i=1..n prime(i)). A306834

a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n). A96460

Number of 7-step self-avoiding walks on an n X n square summed over all starting positions. A188152

Expansion of 1/(1 + x + x/(1 + x² + x²/(1 + x³ + x³/(1 + x⁴ + x⁴/(1 + ...))))), a continued fraction. A292854

a(n) is the sum of the terms of the symmetric square array defined by M(i,j) = prime(i)+i-j for i >= j and M(i,j) = M(j,i) if i < j. A308731

Sum of the prime numbers in, but not on the border of, an n X n square array whose elements are the numbers from 1..n², listed in increasing order by rows. A344847

a(n) = ∑_k=1..n n^k. A31972

T(n,k)=Number of n-step self-avoiding walks on a kXk square summed over all starting positions. A188147

a(n) is the number of complement pairs of 2n-bead balanced bicolor necklaces. A386388

a(n) is the number of complement pairs of primitive 2n-bead balanced binary necklaces. A383904