The number 60502
60502 is a composite number with 12 divisors. Its prime factorisation is 2 × × 179. Divisors (12): 1, 2, 13, 26, 169, 179, 338, 358, 2327, 4654, 30251, 60502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60502: a Harshad number: divisible by its digit sum 13.
- 2
60502 is composite. Its prime factorisation is
- 3
The divisors add up to 98820; without 60502 itself that is 38318, so 60502 is deficient (38318 is less than 60502). Euler's totient φ(60502) = 27768 numbers up to 60502 share no factor with it.
- 4
The digits of 60502 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60502 = 2 \times 13^{2} \times 179 \]60502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 98820 |
| Euler totient φ(n) | 27768 |
| Square | 3660492004 |
| Cube | 221467087226008 |
| Square root | 245.971543 (= 13√358) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.0502 × |
60502 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and two |
| Binary (base 2) | 1110110001010110 |
| Octal (base 8) | 166126 |
| Hexadecimal (base 16) | EC56 |
| Base 3 | 10001222211 |
| As time | 60502 seconds = 16 h 48 min 22 s |
Is 60502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60502 ÷ 2 = 30251) | 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 2) | 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 4) | 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 6) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60502 a prime number?
No. 60502 = 2 × × 179, so it is divisible by 2.
What are the factors of 60502?
1, 2, 13, 26, 169, 179, 338, 358, 2327, 4654, 30251, 60502.
What is 60502 in binary?
1110110001010110 (hexadecimal EC56, octal 166126).
What is the square root of 60502?
About 245.9715, exactly 13√358.
Is 60502 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 60502?
60502 is a Harshad number: divisible by its digit sum 13.