Properties of the Number 92380

Ninety-Two Thousand Three Hundred Eighty

Basics

Value: 92379 → 92380 → 92381

Parity: even

Prime: No

Previous Prime: 92377

Next Prime: 92381

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 31 × 149

Divisors: 1, 2, 4, 5, 10, 20, 31, 62, 124, 149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110100011011100

Octal: 264334

Duodecimal: 45564

Hexadecimal: 168dc

Square: 8534064400

Square Root: 303.94078370630024

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..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one. A231806

a(n) = ∑_{k=0..floor(5·n/9)} binomial(k,5·n-9·k). A392356

a(n) = binomial(2·n-5,n-2) + 2. A52473

Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 9). A212389

a(n) = ∑_k=0..n binomial(k, 9*(n-k)). A306753

"BGJ" (reversible, element, labeled) transform of 1,2,3,4... A32054

Difference between the sum of odd parts and the sum of even parts in all the partitions of n. A208477

Number of (n+1)X(3+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one. A231801

Number of (n+1)X(5+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one. A231803

The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by eight loops is conjectured to be given by a(n)/A_HT(n)², where A_HT(n) is the number of n X n half turn symmetric alternating sign matrices. A92380