Properties of the Number 26804

Twenty-Six Thousand Eight Hundred Four

Basics

Value: 26803 → 26804 → 26805

Parity: even

Prime: No

Previous Prime: 26801

Next Prime: 26813

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 6701

Divisors: 1, 2, 4, 6701, 13402, 26804

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100010110100

Octal: 64264

Duodecimal: 13618

Hexadecimal: 68b4

Square: 718454416

Square Root: 163.7192719260625

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

T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of trunc(x(i)/x(i+1)) equal to zero. A189545

Square table, read by antidiagonals, of coefficients of x^k in the n-th self-composition of the g.f. of A120009, so that: T(n,k) = [x^k] { (x-x²) o x/(1-n·x) o (1-sqrt(1-4·x))/2 } for n>=1, k>=1. A120013

Number of arrangements of n+1 nonzero numbers x(i) in -4..4 with the sum of trunc(x(i)/x(i+1)) equal to zero. A189540

Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero. A189549

Triangle read by rows: T(n,m) = ∑_k=0..n C(k-1,m-1)*C(k,m-1)*C(n+k-1,n-k)/m. A257142

Number of partitions of n in which the least part is odd. A26804

Number of (n+2)X(1+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 4 5 or 7. A251993