The number 25715
25715 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 139. Divisors (8): 1, 5, 37, 139, 185, 695, 5143, 25715.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25715 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25715 is composite. Its prime factorisation is
- 3
The divisors add up to 31920; without 25715 itself that is 6205, so 25715 is deficient (6205 is less than 25715). Euler's totient φ(25715) = 19872 numbers up to 25715 share no factor with it.
- 4
The digits of 25715 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 170 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25715 = 5 \times 37 \times 139 \]
25715 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31920 |
| Euler totient φ(n) | 19872 |
| Square | 661261225 |
| Cube | 17004332400875 |
| Square root | 160.358972 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 170 |
| Scientific notation | 2.5715 × |
25715 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand seven hundred and fifteen |
| Binary (base 2) | 110010001110011 |
| Octal (base 8) | 62163 |
| Hexadecimal (base 16) | 6473 |
| Base 3 | 1022021102 |
| As time | 25715 seconds = 7 h 8 min 35 s |
Is 25715 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 (25715 ÷ 5 = 5143) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 8) | 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 25715 a prime number?
No. 25715 = 5 × 37 × 139, so it is divisible by 5.
What are the factors of 25715?
1, 5, 37, 139, 185, 695, 5143, 25715.
What is 25715 in binary?
110010001110011 (hexadecimal 6473, octal 62163).
What is the square root of 25715?
About 160.3590.
Is 25715 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 25715?
It is a composite number with 8 divisors.