Properties of the Number 92372

Ninety-Two Thousand Three Hundred Seventy-Two

Basics

Value: 92371 → 92372 → 92373

Parity: even

Prime: No

Previous Prime: 92369

Next Prime: 92377

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 7 × 3299

Divisors: 1, 2, 4, 7, 14, 28, 3299, 6598, 13196, 23093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110100011010100

Octal: 264324

Duodecimal: 45558

Hexadecimal: 168d4

Square: 8532586384

Square Root: 303.92762296309957

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

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UUDDUDUUUUDUDDDDUUDD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-2)/8)), read by rows. A242450

Least k such that k·Mersenne-prime(n)-1 is prime. A98555

Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence. A101416

Let P(n) = primorial(n) = A002110(n); a(n) is the number of primes q < P(n) such that P(n) - q is also prime and q²==1 (mod P(n)). A336093

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 zero 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. A92372

Number of (n+1) X 4 binary arrays with every 2 X 2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock traces. A186933