Properties of the Number 25631

Twenty-Five Thousand Six Hundred Thirty-One

Basics

Value: 25630 → 25631 → 25632

Parity: odd

Prime: No

Previous Prime: 25621

Next Prime: 25633

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 19 ² × 71

Divisors: 1, 19, 71, 361, 1349, 25631

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010000011111

Octal: 62037

Duodecimal: 129BB

Hexadecimal: 641f

Square: 656948161

Square Root: 160.09684569035082

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) = F(n+1)² + F(n+1)*F(n) - F(n)², where F = A000045. A236428

a(n) = a(n-1) + a(n-3) + a(n-4), with a(0)=a(1)=a(2)=a(3)=1. A126116

Numbers w such that (F(2·n-1)², -F(2·n)², w) are primitive solutions of the Diophantine equation 2·x³ + 2·y³ + z³ = 1, where F(n) is the n-th Fibonacci number (A000045). A337929

Number of asymmetric rooted polygonal cacti with bridges (mixed Husimi trees). A35353

Row sums of a characteristic triangle for the Fibonacci numbers. A110034

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 366", based on the 5-celled von Neumann neighborhood. A287854

a(n) = -A292140(n)/2. A292141

a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 0, a(3) = 1. A295683

a(n) = F(n)*F(n+1) mod L(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers. A348592

Numbers k such that A372692(k) = A372692(k+1) > 1. A372693