Properties of the Number 91972

Ninety-One Thousand Nine Hundred Seventy-Two

Basics

Value: 91971 → 91972 → 91973

Parity: even

Prime: No

Previous Prime: 91969

Next Prime: 91997

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 22993

Divisors: 1, 2, 4, 22993, 45986, 91972

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110011101000100

Octal: 263504

Duodecimal: 45284

Hexadecimal: 16744

Square: 8458848784

Square Root: 303.2688576164721

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

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A219802

Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX5 array. A219799

Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 5Xn array. A219806

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

Number of strings of numbers x(i=1..8) in 0..n with sum i²*x(i)³ equal to 64·n³. A184323

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

Expansion of g.f. (1 + x⁵ ) / ( (1-x³)*(1-x⁴)). A91972