The number 93802
93802 is a composite number with 4 divisors. Its prime factorisation is 2 × 46901. Divisors (4): 1, 2, 46901, 93802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93802: a semiprime: 2 × 46901, the product of two primes.
- 2
93802 is composite. Its prime factorisation is
- 3
The divisors add up to 140706; without 93802 itself that is 46904, so 93802 is deficient (46904 is less than 93802). Euler's totient φ(93802) = 46900 numbers up to 93802 share no factor with it.
- 4
The digits of 93802 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93802 = 2 \times 46901 \]
93802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 140706 |
| Euler totient φ(n) | 46900 |
| Square | 8798815204 |
| Cube | 825346463765608 |
| Square root | 306.271122 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 40 |
| Scientific notation | 9.3802 × |
93802 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and two |
| Binary (base 2) | 10110111001101010 |
| Octal (base 8) | 267152 |
| Hexadecimal (base 16) | 16E6A |
| Base 3 | 11202200011 |
| As time | 93802 seconds = 26 h 3 min 22 s |
Is 93802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93802 ÷ 2 = 46901) | 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 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 2) | 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 5) | 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 93802 a prime number?
No. 93802 = 2 × 46901, so it is divisible by 2.
What are the factors of 93802?
1, 2, 46901, 93802.
What is 93802 in binary?
10110111001101010 (hexadecimal 16E6A, octal 267152).
What is the square root of 93802?
About 306.2711.
Is 93802 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 93802?
93802 is a semiprime: 2 × 46901, the product of two primes.