The number 93213
93213 is a composite number with 6 divisors. Its prime factorisation is × 10357. Divisors (6): 1, 3, 9, 10357, 31071, 93213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93213 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93213 is composite. Its prime factorisation is
- 3
The divisors add up to 134654; without 93213 itself that is 41441, so 93213 is deficient (41441 is less than 93213). Euler's totient φ(93213) = 62136 numbers up to 93213 share no factor with it.
- 4
The digits of 93213 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93213 = 3^{2} \times 10357 \]93213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 134654 |
| Euler totient φ(n) | 62136 |
| Square | 8688663369 |
| Cube | 809896378614597 |
| Square root | 305.308041 (= 3√10357) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3213 × |
93213 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and thirteen |
| Binary (base 2) | 10110110000011101 |
| Octal (base 8) | 266035 |
| Hexadecimal (base 16) | 16C1D |
| Base 3 | 11201212100 |
| As time | 93213 seconds = 25 h 53 min 33 s |
Is 93213 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93213 ÷ 3 = 31071) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93213 ÷ 9 = 10357) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93213 a prime number?
No. 93213 = × 10357, so it is divisible by 3.
What are the factors of 93213?
1, 3, 9, 10357, 31071, 93213.
What is 93213 in binary?
10110110000011101 (hexadecimal 16C1D, octal 266035).
What is the square root of 93213?
About 305.3080, exactly 3√10357.
Is 93213 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 93213?
It is a composite number with 6 divisors.