Properties of the Number 26880

Twenty-Six Thousand Eight Hundred Eighty

Basics

Value: 26879 → 26880 → 26881

Parity: even

Prime: No

Previous Prime: 26879

Next Prime: 26881

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁸ × 3 × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100100000000

Octal: 64400

Duodecimal: 13680

Hexadecimal: 6900

Square: 722534400

Square Root: 163.95121225535357

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

11-almost primes (generalization of semiprimes). A69272

a(n) = n * σ(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341528

A factorial-like triangle read by rows: T(0,0) = 1; T(n+1,0) = T(n,0)+1; T(n+1,k+1) = T(n,0)*T(n,k), k=0..n. A245334

a(n) = 2^n-1 * n! * Catalan(n-1) for n > 0 with a(0) = 0. A52714

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u = (1,1) and d = (1,-1)]. A91894

Negated coefficients of Chebyshev T polynomials: [xⁿ](-T(n+6, x)), n >= 0. A1794

Triangle read by rows: a(n,k) = number of k-length walks in the Hasse diagram of a Boolean algebra of order n. A90802

Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways. A68314

Triangle of number of functions in a size n set for which the sequence of composition powers ends in a length k cycle. A222029

Octuple factorial, 8-factorial, n!8, n!!!!!!!!. A114800