Properties of the Number 25876

Twenty-Five Thousand Eight Hundred Seventy-Six

Basics

Value: 25875 → 25876 → 25877

Parity: even

Prime: No

Previous Prime: 25873

Next Prime: 25889

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 6469

Divisors: 1, 2, 4, 6469, 12938, 25876

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100010100

Octal: 62424

Duodecimal: 12B84

Hexadecimal: 6514

Square: 669567376

Square Root: 160.86018774078315

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

a(n) = floor(1/(ζ(4) - ∑_h=1..n 1/h⁴)). A248230

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A120973. A381603

Nearest integer to 1/(∑_k>=n 1/k⁴). A83559

σ(n)-n values in A085844. A216383

Floor(AGM(n², n³)), where AGM denotes the arithmetic-geometric mean. A234362

Smallest k such that both of the consecutive Woodall numbers A003261(k) and A003261(k+1) are divisible by A014662(n), the n-th prime p with even order of 2 mod p. A287145

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..2, with k running over the positive integers; square array, read by antidiagonals, downwards. A319060

Expansion of 1/((1-x⁵)*(1-x⁶)*(1-x⁷)). A25876

Number of ways n can be expressed as the sum of a square and a triangular number. A82660