The number 60315
60315 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 4021. Divisors (8): 1, 3, 5, 15, 4021, 12063, 20105, 60315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60315: a Harshad number: divisible by its digit sum 15.
- 2
60315 is composite. Its prime factorisation is
- 3
The divisors add up to 96528; without 60315 itself that is 36213, so 60315 is deficient (36213 is less than 60315). Euler's totient φ(60315) = 32160 numbers up to 60315 share no factor with it.
- 4
The digits of 60315 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60315 = 3 \times 5 \times 4021 \]
60315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 96528 |
| Euler totient φ(n) | 32160 |
| Square | 3637899225 |
| Cube | 219419891755875 |
| Square root | 245.591124 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 104 |
| Scientific notation | 6.0315 × |
60315 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and fifteen |
| Binary (base 2) | 1110101110011011 |
| Octal (base 8) | 165633 |
| Hexadecimal (base 16) | EB9B |
| Base 3 | 10001201220 |
| As time | 60315 seconds = 16 h 45 min 15 s |
Is 60315 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 | Yes (60315 ÷ 3 = 20105) | 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 (60315 ÷ 5 = 12063) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60315 a prime number?
No. 60315 = 3 × 5 × 4021, so it is divisible by 3.
What are the factors of 60315?
1, 3, 5, 15, 4021, 12063, 20105, 60315.
What is 60315 in binary?
1110101110011011 (hexadecimal EB9B, octal 165633).
What is the square root of 60315?
About 245.5911.
Is 60315 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 60315?
60315 is a Harshad number: divisible by its digit sum 15.