Properties of the Number 26215

Twenty-Six Thousand Two Hundred Fifteen

Basics

Value: 26214 → 26215 → 26216

Parity: odd

Prime: No

Previous Prime: 26209

Next Prime: 26227

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 7 ² × 107

Divisors: 1, 5, 7, 35, 49, 107, 245, 535, 749, 3745

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011001100111

Octal: 63147

Duodecimal: 13207

Hexadecimal: 6667

Square: 687226225

Square Root: 161.9104690870853

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

a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026519. A26531

a(n) = 3·a(n-1) + 4·a(n-2), a(0)=a(1)=1. A102900

Expansion of (1-x)/(1-2·x+x²-2·x³). A7909

Inverse binomial transform of 1, 2, 2, 4, 10, 20, ... = A100088. A137470

Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0. A340986

a(n) is the least number k such that A066323(k) = n. A342728

Positions of check bits in code in A075946. A75948

dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5). A26063

a(n) = ceiling(2^n-1/n). A53637

Number of (n+2) X (1+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits. A262267