Properties of the Number 25280

Twenty-Five Thousand Two Hundred Eighty

Basics

Value: 25279 → 25280 → 25281

Parity: even

Prime: No

Previous Prime: 25261

Next Prime: 25301

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁶ × 5 × 79

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001011000000

Octal: 61300

Duodecimal: 12768

Hexadecimal: 62c0

Square: 639078400

Square Root: 158.99685531481433

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 enriched r-trees of size n with no empty subtrees. A301467

T(n,k) = Number of length n+3 0..k arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth. A249290

T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279580

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237544

Numbers k for which A306927(k) [= A001615(k)-k] is a multiple of A344705(k) [= A001615(k)-A001065(k)], and their quotient is nonnegative. A344700

Expansion of (1 + x³ - x⁴)/((1 + x³ - x⁴)² - 4·x³). A376727

Euler transform of {1, primes}. A30012

Eight times hexagonal numbers: a(n) = 8·n*(2·n-1). A152750

The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs). A180577

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1. A49942