The number 30602
30602 is a composite number with 16 divisors. Its prime factorisation is 2 × 11 × 13 × 107. Divisors (16): 1, 2, 11, 13, 22, 26, 107, 143, 214, 286, 1177, 1391, 2354, 2782, 15301, 30602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30602: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 11.
- 2
30602 is composite. Its prime factorisation is
- 3
The divisors add up to 54432; without 30602 itself that is 23830, so 30602 is deficient (23830 is less than 30602). Euler's totient φ(30602) = 12720 numbers up to 30602 share no factor with it.
- 4
The digits of 30602 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30602 = 2 \times 11 \times 13 \times 107 \]
30602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 54432 |
| Euler totient φ(n) | 12720 |
| Square | 936482404 |
| Cube | 28658234527208 |
| Square root | 174.934273 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.0602 × |
30602 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand six hundred and two |
| Binary (base 2) | 111011110001010 |
| Octal (base 8) | 73612 |
| Hexadecimal (base 16) | 778A |
| Base 3 | 1112222102 |
| As time | 30602 seconds = 8 h 30 min 2 s |
Is 30602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30602 ÷ 2 = 15301) | 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 5) | 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 2) | 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 (30602 ÷ 11 = 2782) | 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 30602 a prime number?
No. 30602 = 2 × 11 × 13 × 107, so it is divisible by 2.
What are the factors of 30602?
1, 2, 11, 13, 22, 26, 107, 143, 214, 286, 1177, 1391, 2354, 2782, 15301, 30602.
What is 30602 in binary?
111011110001010 (hexadecimal 778A, octal 73612).
What is the square root of 30602?
About 174.9343.
Is 30602 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 30602?
30602 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 11.