The number 25565
25565 is a composite number with 4 divisors. Its prime factorisation is 5 × 5113. Divisors (4): 1, 5, 5113, 25565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25565: a semiprime: 5 × 5113, the product of two primes.
- 2
25565 is composite. Its prime factorisation is
- 3
The divisors add up to 30684; without 25565 itself that is 5119, so 25565 is deficient (5119 is less than 25565). Euler's totient φ(25565) = 20448 numbers up to 25565 share no factor with it.
- 4
The digits of 25565 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25565 = 5 \times 5113 \]
25565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 30684 |
| Euler totient φ(n) | 20448 |
| Square | 653569225 |
| Cube | 16708497237125 |
| Square root | 159.890588 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5565 × |
25565 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand five hundred and sixty-five |
| Binary (base 2) | 110001111011101 |
| Octal (base 8) | 61735 |
| Hexadecimal (base 16) | 63DD |
| Base 3 | 1022001212 |
| As time | 25565 seconds = 7 h 6 min 5 s |
Is 25565 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (25565 ÷ 5 = 5113) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25565 a prime number?
No. 25565 = 5 × 5113, so it is divisible by 5.
What are the factors of 25565?
1, 5, 5113, 25565.
What is 25565 in binary?
110001111011101 (hexadecimal 63DD, octal 61735).
What is the square root of 25565?
About 159.8906.
Is 25565 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 25565?
25565 is a semiprime: 5 × 5113, the product of two primes.