Properties of the Number 26845

Twenty-Six Thousand Eight Hundred Forty-Five

Basics

Value: 26844 → 26845 → 26846

Parity: odd

Prime: No

Previous Prime: 26839

Next Prime: 26849

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 7 × 13 × 59

Divisors: 1, 5, 7, 13, 35, 59, 65, 91, 295, 413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100011011101

Octal: 64335

Duodecimal: 13651

Hexadecimal: 68dd

Square: 720654025

Square Root: 163.84443841644426

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

Square array T(n,d) read by antidiagonals: number of structurally-different guillotine partitions of a d-dimensional box in R^d by n hyperplanes. A103209

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically. A208028

a(n) = (1/n)*∑_i=0..n-1 C(n,i)*C(n,i+1)*6ⁱ*7^n-i, a(0)=1. A133307

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A316763

Expansion of (∏_j>=1 (1-(-x)^j) - 1)¹⁴ in powers of x. A47639

Odd composites (including 1 in the count) where the number 1 mod 4 equals the number 3 mod 4. A93180

Triangle related to guillotine partitions of a k-dimensional box by n hyperplanes. A107702

Number of words of length 4 in the n(n-1)/2 transpositions of S[ n ] equivalent to the identity. A29699

Terms of A050530 with four prime divisors. A53340

Number of n X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically. A208022