The number 93236
93236 is a composite number with 24 divisors. Its prime factorisation is × 11 × 13 × 163. Divisors (24): 1, 2, 4, 11, 13, 22, 26, 44, 52, 143, 163, 286, 326, 572, 652, 1793 … 93236.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93236: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93236 is composite. Its prime factorisation is
- 3
The divisors add up to 192864; without 93236 itself that is 99628, so 93236 is abundant (99628 is more than 93236). Euler's totient φ(93236) = 38880 numbers up to 93236 share no factor with it.
- 4
The digits of 93236 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93236 = 2^{2} \times 11 \times 13 \times 163 \]93236 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 192864 |
| Euler totient φ(n) | 38880 |
| Square | 8692951696 |
| Cube | 810496044328256 |
| Square root | 305.345706 (= 2√23309) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3236 × |
93236 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and thirty-six |
| Binary (base 2) | 10110110000110100 |
| Octal (base 8) | 266064 |
| Hexadecimal (base 16) | 16C34 |
| Base 3 | 11201220012 |
| As time | 93236 seconds = 25 h 53 min 56 s |
Is 93236 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93236 ÷ 2 = 46618) | 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 (93236 ÷ 4 = 23309) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (93236 ÷ 11 = 8476) | 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 93236 a prime number?
No. 93236 = × 11 × 13 × 163, so it is divisible by 2.
What are the factors of 93236?
1, 2, 4, 11, 13, 22, 26, 44, 52, 143, 163, 286, 326, 572, 652, 1793, 2119, 3586, 4238, 7172, 8476, 23309, 46618, 93236.
What is 93236 in binary?
10110110000110100 (hexadecimal 16C34, octal 266064).
What is the square root of 93236?
About 305.3457, exactly 2√23309.
Is 93236 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 93236?
93236 is a happy number: repeatedly adding the squares of its digits reaches 1.