The number 25915
25915 is a composite number with 8 divisors. Its prime factorisation is 5 × 71 × 73. Divisors (8): 1, 5, 71, 73, 355, 365, 5183, 25915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25915 is composite. Its prime factorisation is
- 3
The divisors add up to 31968; without 25915 itself that is 6053, so 25915 is deficient (6053 is less than 25915). Euler's totient φ(25915) = 20160 numbers up to 25915 share no factor with it.
- 4
The digits of 25915 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25915 = 5 \times 71 \times 73 \]
25915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31968 |
| Euler totient φ(n) | 20160 |
| Square | 671587225 |
| Cube | 17404182935875 |
| Square root | 160.981365 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 51 |
| Scientific notation | 2.5915 × |
25915 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and fifteen |
| Binary (base 2) | 110010100111011 |
| Octal (base 8) | 62473 |
| Hexadecimal (base 16) | 653B |
| Base 3 | 1022112211 |
| As time | 25915 seconds = 7 h 11 min 55 s |
Is 25915 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 1) | 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 (25915 ÷ 5 = 5183) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25915 a prime number?
No. 25915 = 5 × 71 × 73, so it is divisible by 5.
What are the factors of 25915?
1, 5, 71, 73, 355, 365, 5183, 25915.
What is 25915 in binary?
110010100111011 (hexadecimal 653B, octal 62473).
What is the square root of 25915?
About 160.9814.
Is 25915 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 25915?
It is a composite number with 8 divisors.