Properties of the Number 25808

Twenty-Five Thousand Eight Hundred Eight

Basics

Value: 25807 → 25808 → 25809

Parity: even

Prime: No

Previous Prime: 25801

Next Prime: 25819

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 1613

Divisors: 1, 2, 4, 8, 16, 1613, 3226, 6452, 12904, 25808

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010011010000

Octal: 62320

Duodecimal: 12B28

Hexadecimal: 64d0

Square: 666052864

Square Root: 160.64868502418562

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

Number of subsets of {1..n} without a subset summing to n. A365377

T(n,k)=Half the number of (n+2)X(k+2) binary arrays with each 3X3 subblock having sum 4 or 5. A186825

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A302010

a(n) is the index of the smallest triangular number containing exactly n 3's. A48358

G.f. satisfies: A(x) = ∏_n>=1 (1 + xⁿ*A(x))/(1 - xⁿ*A(x)). A190862

Dirichlet self-convolution of the integer partition numbers A000041. A323764

Denominators of continued fraction convergents to sqrt(261). A41489

Half the number of (n+2)X4 binary arrays with each 3X3 subblock having sum 4 or 5. A186818

Half the number of (n+2)X5 binary arrays with each 3X3 subblock having sum 4 or 5. A186819

Number of n X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A302005