Properties of the Number 26212

Twenty-Six Thousand Two Hundred Twelve

Basics

Value: 26211 → 26212 → 26213

Parity: even

Prime: No

Previous Prime: 26209

Next Prime: 26227

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 6553

Divisors: 1, 2, 4, 6553, 13106, 26212

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011001100100

Octal: 63144

Duodecimal: 13204

Hexadecimal: 6664

Square: 687068944

Square Root: 161.90120444270946

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

Every suffix prime and no 0 digits in base 9 (written in base 9). A24784

a(n) = 4·floor(24·2ⁿ/15) = 4·A077854(n). A102652

Triangle, read by rows, where T(n,k) = n·T(n-1,k-1) + T(n-1,k-2) for n>0 and k>1, with T(n,0) = T(n-1,n-1) and T(n,1) = n·T(n-1,0) for n>0 and T(0,0) = 1. A132005

Starting positions of strings of three 6's in the decimal expansion of π. A83625

a(n) = ∑_k=0..n (-1)^k * binomial(n+2·k+5,n-k) * Fibonacci(k+1). A390858

Numbers n such that there are exactly 4 primes p such that floor(n·log(n))+1<=p<=floor((n+1)*log(n+1))-1. A68362

Triangle T(n,k) (n>=0, 0<=k<=n) read by rows: use T(n,k)=T(n,k-1)+T(n-1,k-1) rule except left edge is the sequence read by rows, initial values are T(0,0)=0, T(1,0)=1. A297497

Let n = ∑_i=0..k d_i*4ⁱ be the base-4 expansion of n, with 0 <= d_i < 4. Then a(n) = minimal i such that d_i is not 1, or k+1 if there is no such i. A258059

Duplicate of A026188. A26212