The number 60507
60507 is a composite number with 14 divisors. Its prime factorisation is × 83. Divisors (14): 1, 3, 9, 27, 81, 83, 243, 249, 729, 747, 2241, 6723, 20169, 60507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60507 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60507 is composite. Its prime factorisation is
- 3
The divisors add up to 91812; without 60507 itself that is 31305, so 60507 is deficient (31305 is less than 60507). Euler's totient φ(60507) = 39852 numbers up to 60507 share no factor with it.
- 4
The digits of 60507 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60507 = 3^{6} \times 83 \]60507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 91812 |
| Euler totient φ(n) | 39852 |
| Square | 3661097049 |
| Cube | 221521999143843 |
| Square root | 245.981707 (= 27√83) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0507 × |
60507 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and seven |
| Binary (base 2) | 1110110001011011 |
| Octal (base 8) | 166133 |
| Hexadecimal (base 16) | EC5B |
| Base 3 | 10002000000 |
| As time | 60507 seconds = 16 h 48 min 27 s |
Is 60507 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 (60507 ÷ 3 = 20169) | 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 | No (remainder 2) | 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 6) | 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 | Yes (60507 ÷ 9 = 6723) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 60507 a prime number?
No. 60507 = × 83, so it is divisible by 3.
What are the factors of 60507?
1, 3, 9, 27, 81, 83, 243, 249, 729, 747, 2241, 6723, 20169, 60507.
What is 60507 in binary?
1110110001011011 (hexadecimal EC5B, octal 166133).
What is the square root of 60507?
About 245.9817, exactly 27√83.
Is 60507 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 60507?
It is a composite number with 14 divisors.