Properties of the Number 25877

Twenty-Five Thousand Eight Hundred Seventy-Seven

Basics

Value: 25876 → 25877 → 25878

Parity: odd

Prime: No

Previous Prime: 25873

Next Prime: 25889

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 113 × 229

Divisors: 1, 113, 229, 25877

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100010101

Octal: 62425

Duodecimal: 12B85

Hexadecimal: 6515

Square: 669619129

Square Root: 160.86329600005092

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

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Composite numbers k that divide Fibonacci(k+1). A69107

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Lucas pseudoprimes. A217120

Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol. A340097

Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1). A182554

Odd composite integers m such that A000032(2·m-J(m,5)) == J(m,5) (mod m), where J(m,5) is the Jacobi symbol. A339517

Odd composite integers m such that A000045(2·m-J(m,5)) == 1 (mod m), where J(m,5) is the Jacobi symbol. A340118

Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1. A94412

a(n) = (A269590(n)² + 4)/5ⁿ, n >= 0. A269594