Properties of the Number 26222

Twenty-Six Thousand Two Hundred Twenty-Two

Basics

Value: 26221 → 26222 → 26223

Parity: even

Prime: No

Previous Prime: 26209

Next Prime: 26227

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 1873

Divisors: 1, 2, 7, 14, 1873, 3746, 13111, 26222

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011001101110

Octal: 63156

Duodecimal: 13212

Hexadecimal: 666e

Square: 687593284

Square Root: 161.93208452928653

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

Numbers n with digits 2 and 6 only. A284632

Numbers k such that 60·R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A56658

a(n) = 1 + ∑_k=1..n-3 a(k) * a(n-k-3). A346075

Structured pentagonal icositetrahedral numbers (vertex structure 10). A100168

Triangle H(n,j) (n=1,2,3,..., j=2,3,4,...) read by rows: let X(k,l,n) := Stirling2(n,k)*Stirling2(k,l) for 1<=k<=n and 1<=l<=k. Then H(n,j)= ∑_{k+l=j, 1<=k<=n and 1<=l<=k} X(k,l,n). A136206

Triangle read by rows: T(n,k) (1 <= k <= n) given by T(n,1) = T(n,n) = 1, otherwise T(n,k) = (m·n-m·k+1)*T(n-1,k-1) + (m·k-m+1)*T(n-1,k), where m = -5. A392666

Number of Ruth-Aaron numbers (with multiplicity) less than 10ⁿ. A101805

The number of coreful abundant numbers (A308053) below 10ⁿ. A308054

Numbers k such that A026136(k) = A026142(k). A26222