The number 60302
60302 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2741. Divisors (8): 1, 2, 11, 22, 2741, 5482, 30151, 60302.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60302: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 11.
- 2
60302 is composite. Its prime factorisation is
- 3
The divisors add up to 98712; without 60302 itself that is 38410, so 60302 is deficient (38410 is less than 60302). Euler's totient φ(60302) = 27400 numbers up to 60302 share no factor with it.
- 4
The digits of 60302 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60302 = 2 \times 11 \times 2741 \]
60302 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98712 |
| Euler totient φ(n) | 27400 |
| Square | 3636331204 |
| Cube | 219278044263608 |
| Square root | 245.564655 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.0302 × |
60302 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and two |
| Binary (base 2) | 1110101110001110 |
| Octal (base 8) | 165616 |
| Hexadecimal (base 16) | EB8E |
| Base 3 | 10001201102 |
| As time | 60302 seconds = 16 h 45 min 2 s |
Is 60302 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60302 ÷ 2 = 30151) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 | Yes (60302 ÷ 11 = 5482) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60302 a prime number?
No. 60302 = 2 × 11 × 2741, so it is divisible by 2.
What are the factors of 60302?
1, 2, 11, 22, 2741, 5482, 30151, 60302.
What is 60302 in binary?
1110101110001110 (hexadecimal EB8E, octal 165616).
What is the square root of 60302?
About 245.5647.
Is 60302 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 60302?
60302 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 11.