Properties of the Number 31892

Thirty-One Thousand Eight Hundred Ninety-Two

Basics

Value: 31891 → 31892 → 31893

Parity: even

Prime: No

Previous Prime: 31891

Next Prime: 31907

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 7 × 17 × 67

Divisors: 1, 2, 4, 7, 14, 17, 28, 34, 67, 68

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110010010100

Octal: 76224

Duodecimal: 16558

Hexadecimal: 7c94

Square: 1017099664

Square Root: 178.58331389018403

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

G.f.: 1/((1-x)*(1-x²))³. A38163

T(n,k)=Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no 2-cycles and with no more than k-1 elements moved to themselves. A271852

a(n) = 36·n² - 17·n + 2. A157265

Partial sums of A005587. Fourth column of triangle A115127. A115129

Expansion of (3+x)/(1-x)⁶. A59599

Records in A119632. A210611

Number of (w,x,y,z) with all terms in {1,...,n} and w·x+y·z>=n². A212132

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 1), (0, 1, 1), (1, -1, -1)}. A148219

Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no 2-cycles and with no more than 1-1 elements moved to themselves. A271845

Table read by antidiagonals: T(n,k) is the number of strings of numbers x(i=1..n) in 0..k with sum i⁴*x(i) equal to n⁴*k. A184348