The number 25295
25295 is a composite number with 4 divisors. Its prime factorisation is 5 × 5059. Divisors (4): 1, 5, 5059, 25295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25295: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 5059, the product of two primes.
- 2
25295 is composite. Its prime factorisation is
- 3
The divisors add up to 30360; without 25295 itself that is 5065, so 25295 is deficient (5065 is less than 25295). Euler's totient φ(25295) = 20232 numbers up to 25295 share no factor with it.
- 4
The digits of 25295 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 95 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25295 = 5 \times 5059 \]
25295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 30360 |
| Euler totient φ(n) | 20232 |
| Square | 639837025 |
| Cube | 16184677547375 |
| Square root | 159.044019 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 95 |
| Scientific notation | 2.5295 × |
25295 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand two hundred and ninety-five |
| Binary (base 2) | 110001011001111 |
| Octal (base 8) | 61317 |
| Hexadecimal (base 16) | 62CF |
| Base 3 | 1021200212 |
| As time | 25295 seconds = 7 h 1 min 35 s |
Is 25295 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (25295 ÷ 5 = 5059) | 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 4) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25295 a prime number?
No. 25295 = 5 × 5059, so it is divisible by 5.
What are the factors of 25295?
1, 5, 5059, 25295.
What is 25295 in binary?
110001011001111 (hexadecimal 62CF, octal 61317).
What is the square root of 25295?
About 159.0440.
Is 25295 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 25295?
25295 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 5059, the product of two primes.