Properties of the Number 26842

Twenty-Six Thousand Eight Hundred Forty-Two

Basics

Value: 26841 → 26842 → 26843

Parity: even

Prime: No

Previous Prime: 26839

Next Prime: 26849

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 13421

Divisors: 1, 2, 13421, 26842

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100011011010

Octal: 64332

Duodecimal: 1364A

Hexadecimal: 68da

Square: 720492964

Square Root: 163.835283135227

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 of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+1) rectangle. A274594

Expansion of ∏_k>=1 B(x^k), where B(x) is the g.f. of A003114. A327690

Numbers m with decimal expansion (d_k, ..., d₁) such that d_i = m ^ i mod 10 for i = 1..k. A344749

a(n) = sum of unsigned coefficients in (1+x+x²-x³)ⁿ. A192210

Number of subsets of Z_n such that every ordered pair of distinct elements has a different sum. A382400

Consecutive states of the linear congruential pseudo-random number generator 254·s mod (2¹⁶+1) when started at s=1. A384934

Numbers k such that the continued fraction for sqrt(k) has period 99. A20438

a(1)=1; for n>=2, a(n)=sum(1<=i<=j<=n-1, gcd(a(i),a(j))). A99050

Inverse binomial transform of A135318. A373392

Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k²*T(n-1, k), for 0 <= k <= n. A269945