Properties of the Number 26122

Twenty-Six Thousand One Hundred Twenty-Two

Basics

Value: 26121 → 26122 → 26123

Parity: even

Prime: No

Previous Prime: 26119

Next Prime: 26141

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 37 × 353

Divisors: 1, 2, 37, 74, 353, 706, 13061, 26122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011000001010

Octal: 63012

Duodecimal: 1314A

Hexadecimal: 660a

Square: 682358884

Square Root: 161.62301816263673

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

Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2·m)/(2·m)) / numerator(Bernoulli(2·m)/(2·m*(2·m-1))) equals p. A92291

Number of essentially parallel unoriented series-parallel networks with n elements. A339224

Expansion of ∏_k>=1 1/(1 - x^k)^A050985(k). A301597

G.f.: A(x) = x + x·ITERATE²(x + x·ITERATE⁴(x + x·ITERATE⁶(x + x·ITERATE⁸(x + ...)))), where ITERATEⁿ(F(x)) denotes the n-th iteration of F(x), and the nesting of even iterations continue indefinitely. A205320

Poincaré series for hyperbolic reflection group with Coxeter diagram o-(5)-o---o-(5)-o. A265048

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood. A270276

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes). A24597

a(n) is the number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 1, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n), where T is the array in A026120. A26122

Number of (n+1)X(3+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250449