The number 60501
60501 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 43 × 67. Divisors (16): 1, 3, 7, 21, 43, 67, 129, 201, 301, 469, 903, 1407, 2881, 8643, 20167, 60501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60501 is composite. Its prime factorisation is
- 3
The divisors add up to 95744; without 60501 itself that is 35243, so 60501 is deficient (35243 is less than 60501). Euler's totient φ(60501) = 33264 numbers up to 60501 share no factor with it.
- 4
The digits of 60501 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60501 = 3 \times 7 \times 43 \times 67 \]
60501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 95744 |
| Euler totient φ(n) | 33264 |
| Square | 3660371001 |
| Cube | 221456105931501 |
| Square root | 245.969510 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 42 |
| Scientific notation | 6.0501 × |
60501 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and one |
| Binary (base 2) | 1110110001010101 |
| Octal (base 8) | 166125 |
| Hexadecimal (base 16) | EC55 |
| Base 3 | 10001222210 |
| As time | 60501 seconds = 16 h 48 min 21 s |
Is 60501 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 (60501 ÷ 3 = 20167) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (60501 ÷ 7 = 8643) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60501 a prime number?
No. 60501 = 3 × 7 × 43 × 67, so it is divisible by 3.
What are the factors of 60501?
1, 3, 7, 21, 43, 67, 129, 201, 301, 469, 903, 1407, 2881, 8643, 20167, 60501.
What is 60501 in binary?
1110110001010101 (hexadecimal EC55, octal 166125).
What is the square root of 60501?
About 245.9695.
Is 60501 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 60501?
It is a composite number with 16 divisors.