Properties of the Number 25481

Twenty-Five Thousand Four Hundred Eighty-One

Basics

Value: 25480 → 25481 → 25482

Parity: odd

Prime: No

Previous Prime: 25471

Next Prime: 25523

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 83 × 307

Divisors: 1, 83, 307, 25481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110001110001001

Octal: 61611

Duodecimal: 128B5

Hexadecimal: 6389

Square: 649281361

Square Root: 159.62769183321547

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

Composite numbers generated by the Euler polynomial x² + x + 41. A145292

Semiprimes generated by the Euler polynomial x² + x + 41. A228183

Number of bracelet structures using exactly two different colored beads. A56357

G.f. A(x) satisfies: A(x - 4·x*A(x)) = x - 3·x*A(x). A291815

Number of partitions p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p). A241652

Number of unlabeled rooted trees with n nodes in which the branches of any node with more than one distinct branch have empty intersection. A316501

a(n) is the number of representative two-color bracelets (necklaces with turnover allowed) with n beads for n >= 2. A213942

Number of necklaces with n beads colored white or red, where the number of white beads is odd and at least three and turning over is allowed. A263768

a(n) = smallest composite (odd) number greater than a(n-1) such that a(n)+2n is the first prime after a(n). A189118

a(n) = a(n-1) + 2·a(n-2) + (-1)ⁿ. A6904