Properties of the Number 25082

Twenty-Five Thousand Eighty-Two

Basics

Value: 25081 → 25082 → 25083

Parity: even

Prime: No

Previous Prime: 25073

Next Prime: 25087

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 12541

Divisors: 1, 2, 12541, 25082

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110000111111010

Octal: 60772

Duodecimal: 12622

Hexadecimal: 61fa

Square: 629106724

Square Root: 158.3729774930054

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 Dyck paths of semilength n such that all positive levels have the same number of peaks. A287987

Fibonacci-Zumkeller numbers: a(n)=n if n<=3, otherwise the smallest number >= a(n-2) + a(n-1) having at least one common factor with a(n-2), but none with a(n-1). A249357

Cardinality of the Weyl alternation set corresponding to the zero-weight in the adjoint representation of the Lie algebra so(2n+1). A232163

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4. A197469

Partial sums of A253090. A255603

Number of nX4 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A301995

Maximal numerators in approximations to the Aurifeuillian factors of p^p +- 1. A356518

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...). A25082