Properties of the Number 31992

Thirty-One Thousand Nine Hundred Ninety-Two

Basics

Value: 31991 → 31992 → 31993

Parity: even

Prime: No

Previous Prime: 31991

Next Prime: 32003

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 31 × 43

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 31, 43

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110011111000

Octal: 76370

Duodecimal: 16620

Hexadecimal: 7cf8

Square: 1023488064

Square Root: 178.86307612249098

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

Array read by antidiagonals: T(n,k) = φ(kⁿ-1)/n, where φ is Euler's totient function (A000010), n >= 1, k >= 2. A369291

Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1. A98485

Number of free pure symmetric multifunctions with one atom, n positions, and no empty or unitary parts (subexpressions of the form x[] or x[y]). A303027

a(n) = φ(6ⁿ-1)/n, where φ is Euler's totient function (A000010). A295496

The number of right-crucial (with respect to squares) permutations of 1,...,n. A221990

a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = floor(i·j/3). A358158

a(n) is the number of nonsymmetric patterns (no reflective, nor rotational symmetry) which may be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells. A60551

a(n) = (2·n³ + 5·n² - 13·n)/2. A162262

Number of partitions p of n such that max(p) - 2·min(p) is a part of p. A238626

T(n,n-3), array T as in A047120. A47125