The number 93212
93212 is a composite number with 12 divisors. Its prime factorisation is × 7 × 3329. Divisors (12): 1, 2, 4, 7, 14, 28, 3329, 6658, 13316, 23303, 46606, 93212.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93212 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93212 is composite. Its prime factorisation is
- 3
The divisors add up to 186480; without 93212 itself that is 93268, so 93212 is abundant (93268 is more than 93212). Euler's totient φ(93212) = 39936 numbers up to 93212 share no factor with it.
- 4
The digits of 93212 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93212 = 2^{2} \times 7 \times 3329 \]93212 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 186480 |
| Euler totient φ(n) | 39936 |
| Square | 8688476944 |
| Cube | 809870312904128 |
| Square root | 305.306403 (= 2√23303) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3212 × |
93212 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and twelve |
| Binary (base 2) | 10110110000011100 |
| Octal (base 8) | 266034 |
| Hexadecimal (base 16) | 16C1C |
| Base 3 | 11201212022 |
| As time | 93212 seconds = 25 h 53 min 32 s |
Is 93212 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93212 ÷ 2 = 46606) | 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 (93212 ÷ 4 = 23303) | 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 | Yes (93212 ÷ 7 = 13316) | 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 8) | 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 9) | 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 93212 a prime number?
No. 93212 = × 7 × 3329, so it is divisible by 2.
What are the factors of 93212?
1, 2, 4, 7, 14, 28, 3329, 6658, 13316, 23303, 46606, 93212.
What is 93212 in binary?
10110110000011100 (hexadecimal 16C1C, octal 266034).
What is the square root of 93212?
About 305.3064, exactly 2√23303.
Is 93212 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 93212?
It is a composite number with 12 divisors.