The number 93602
93602 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 2753. Divisors (8): 1, 2, 17, 34, 2753, 5506, 46801, 93602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93602: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93602 is composite. Its prime factorisation is
- 3
The divisors add up to 148716; without 93602 itself that is 55114, so 93602 is deficient (55114 is less than 93602). Euler's totient φ(93602) = 44032 numbers up to 93602 share no factor with it.
- 4
The digits of 93602 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93602 = 2 \times 17 \times 2753 \]
93602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 148716 |
| Euler totient φ(n) | 44032 |
| Square | 8761334404 |
| Cube | 820078422883208 |
| Square root | 305.944439 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3602 × |
93602 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and two |
| Binary (base 2) | 10110110110100010 |
| Octal (base 8) | 266642 |
| Hexadecimal (base 16) | 16DA2 |
| Base 3 | 11202101202 |
| As time | 93602 seconds = 26 h 0 min 2 s |
Is 93602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93602 ÷ 2 = 46801) | 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 | No (remainder 3) | 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 93602 a prime number?
No. 93602 = 2 × 17 × 2753, so it is divisible by 2.
What are the factors of 93602?
1, 2, 17, 34, 2753, 5506, 46801, 93602.
What is 93602 in binary?
10110110110100010 (hexadecimal 16DA2, octal 266642).
What is the square root of 93602?
About 305.9444.
Is 93602 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 93602?
93602 is a happy number: repeatedly adding the squares of its digits reaches 1.