Properties of the Number 25097

Twenty-Five Thousand Ninety-Seven

Basics

Value: 25096 → 25097 → 25098

Parity: odd

Prime: Yes

Previous Prime: 25087

Next Prime: 25111

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 25097

Divisors: 1, 25097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001000001001

Octal: 61011

Duodecimal: 12635

Hexadecimal: 6209

Square: 629859409

Square Root: 158.42032697857937

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 A(n,k) of set partitions of [k·n] such that within each block the numbers of elements from all residue classes modulo k are equal for k>0, A(n,0)=1; square array A(n,k), n>=0, k>=0, read by antidiagonals. A275043

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A299194

Number of set partitions of [n²] such that within each block the numbers of elements from all residue classes modulo n are equal for n>0, a(0)=1. A275044

Generalized Bell numbers: column 4 of A275043. A61685

a(n) is the smallest prime in the interval [k·sqrt(k), k·sqrt(k+2)], where k = A001359(n), or a(n)=0 if there is no prime in this interval. A247867

Number of set partitions of [4·n] such that within each block the numbers of elements from all residue classes modulo n are equal for n>0, a(0)=1. A275101

Smallest prime p such that M(n)²+p·M(n)+1 is prime with M(n)= Mersenne primes =A000668(n). A139431

Primes congruent to 26 mod 61. A142824

Primes of the form 2·k² + 9. A201476

Primes of the form 8n² + 9. A201705