The number 25315
25315 is a composite number with 8 divisors. Its prime factorisation is 5 × 61 × 83. Divisors (8): 1, 5, 61, 83, 305, 415, 5063, 25315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25315 is composite. Its prime factorisation is
- 3
The divisors add up to 31248; without 25315 itself that is 5933, so 25315 is deficient (5933 is less than 25315). Euler's totient φ(25315) = 19680 numbers up to 25315 share no factor with it.
- 4
The digits of 25315 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25315 = 5 \times 61 \times 83 \]
25315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31248 |
| Euler totient φ(n) | 19680 |
| Square | 640849225 |
| Cube | 16223098130875 |
| Square root | 159.106882 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.5315 × |
25315 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand three hundred and fifteen |
| Binary (base 2) | 110001011100011 |
| Octal (base 8) | 61343 |
| Hexadecimal (base 16) | 62E3 |
| Base 3 | 1021201121 |
| As time | 25315 seconds = 7 h 1 min 55 s |
Is 25315 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 (25315 ÷ 5 = 5063) | 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 3) | 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 7) | 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 4) | 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 25315 a prime number?
No. 25315 = 5 × 61 × 83, so it is divisible by 5.
What are the factors of 25315?
1, 5, 61, 83, 305, 415, 5063, 25315.
What is 25315 in binary?
110001011100011 (hexadecimal 62E3, octal 61343).
What is the square root of 25315?
About 159.1069.
Is 25315 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 25315?
It is a composite number with 8 divisors.