Properties of the Number 25775

Twenty-Five Thousand Seven Hundred Seventy-Five

Basics

Value: 25774 → 25775 → 25776

Parity: odd

Prime: No

Previous Prime: 25771

Next Prime: 25793

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 ² × 1031

Divisors: 1, 5, 25, 1031, 5155, 25775

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110010010101111

Octal: 62257

Duodecimal: 12ABB

Hexadecimal: 64af

Square: 664350625

Square Root: 160.54594358002322

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

Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 1, m + 3, m + 5, where m == 2 (mod 4). A243580

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k hills of the form ud (a hill is either a ud or a Udd starting at the x-axis). A108433

Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have no hills of the form ud (a hill is either a ud or a Udd starting at the x-axis). A108434

Numbers whose digits are prime and which retain this property when multiplied by some 1-digit prime (i.e., one of 2, 3, 5 or 7). A227922

Products of 3 evil primes (A027699) p,q,r, such that numbers p·q, p·r, q·r, and p·q*r are odious (A000069). A230353

Numbers k such that 461·2^k+1 is prime. A323200

Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero. A316379

Integers w such that the Diophantine equation x² + y³ + z⁴ = w⁵ where GCD(x,y,z)=1 has exactly 5 positive integer solutions. A387023

Expansion of 1/((1-x)(1-x⁴)(1-x¹¹)). A25775