The number 93620
93620 is a composite number with 24 divisors. Its prime factorisation is × 5 × 31 × 151. Divisors (24): 1, 2, 4, 5, 10, 20, 31, 62, 124, 151, 155, 302, 310, 604, 620, 755 … 93620.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93620: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 20.
- 2
93620 is composite. Its prime factorisation is
- 3
The divisors add up to 204288; without 93620 itself that is 110668, so 93620 is abundant (110668 is more than 93620). Euler's totient φ(93620) = 36000 numbers up to 93620 share no factor with it.
- 4
The digits of 93620 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
\[ 93620 = 2^{2} \times 5 \times 31 \times 151 \]93620 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 204288 |
| Euler totient φ(n) | 36000 |
| Square | 8764704400 |
| Cube | 820551625928000 |
| Square root | 305.973855 (= 2√23405) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.362 × |
93620 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and twenty |
| Binary (base 2) | 10110110110110100 |
| Octal (base 8) | 266664 |
| Hexadecimal (base 16) | 16DB4 |
| Base 3 | 11202102102 |
| As time | 93620 seconds = 26 h 0 min 20 s |
Is 93620 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93620 ÷ 2 = 46810) | 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 | Yes (93620 ÷ 4 = 23405) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (93620 ÷ 5 = 18724) | 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 2) | 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 4) | 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 | Yes (93620 ÷ 10 = 9362) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93620 a prime number?
No. 93620 = × 5 × 31 × 151, so it is divisible by 2.
What are the factors of 93620?
1, 2, 4, 5, 10, 20, 31, 62, 124, 151, 155, 302, 310, 604, 620, 755, 1510, 3020, 4681, 9362, 18724, 23405, 46810, 93620.
What is 93620 in binary?
10110110110110100 (hexadecimal 16DB4, octal 266664).
What is the square root of 93620?
About 305.9739, exactly 2√23405.
Is 93620 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 93620?
93620 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 20.