Properties of the Number 92320

Ninety-Two Thousand Three Hundred Twenty

Basics

Value: 92319 → 92320 → 92321

Parity: even

Prime: No

Previous Prime: 92317

Next Prime: 92333

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 5 × 577

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110100010100000

Octal: 264240

Duodecimal: 45514

Hexadecimal: 168a0

Square: 8522982400

Square Root: 303.84206423732707

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 (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal. A233989

Expansion of x*(1-6·x+10·x²)/(1-4·x+2·x²)². A94012

Number of (n+1)X(3+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal. A233984

Number of (n+1)X(n+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal. A233981

Egyptian fraction representation of sqrt(58) (A010511) using a greedy function. A248283

"Word-factorable" numbers, or numbers k that are divisible by the number of letters in the American English word(s) for k. A92320

Number of nX4 0..1 arrays with every element unequal to 0, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero. A304415

a(n+2) = 3·a(n) - a(n-2) with a(0) = 1, a(1) = 3, a(2) = 6. A18186

Squares s such that first m and last m digits of the binary representation are perfect positive squares written in binary, and m = floor(binaryLength(s)/2), where binaryLength(s) = A070939(s) is the binary length of s. A226836