The number 93152
93152 is a composite number with 24 divisors. Its prime factorisation is × 41 × 71. Divisors (24): 1, 2, 4, 8, 16, 32, 41, 71, 82, 142, 164, 284, 328, 568, 656, 1136 … 93152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93152 is composite. Its prime factorisation is
- 3
The divisors add up to 190512; without 93152 itself that is 97360, so 93152 is abundant (97360 is more than 93152). Euler's totient φ(93152) = 44800 numbers up to 93152 share no factor with it.
- 4
The digits of 93152 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
\[ 93152 = 2^{5} \times 41 \times 71 \]93152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 190512 |
| Euler totient φ(n) | 44800 |
| Square | 8677295104 |
| Cube | 808307393527808 |
| Square root | 305.208126 (= 4√5822) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3152 × |
93152 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand one hundred and fifty-two |
| Binary (base 2) | 10110101111100000 |
| Octal (base 8) | 265740 |
| Hexadecimal (base 16) | 16BE0 |
| Base 3 | 11201210002 |
| As time | 93152 seconds = 25 h 52 min 32 s |
Is 93152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93152 ÷ 2 = 46576) | 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 (93152 ÷ 4 = 23288) | 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 | 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 | Yes (93152 ÷ 8 = 11644) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 93152 a prime number?
No. 93152 = × 41 × 71, so it is divisible by 2.
What are the factors of 93152?
1, 2, 4, 8, 16, 32, 41, 71, 82, 142, 164, 284, 328, 568, 656, 1136, 1312, 2272, 2911, 5822, 11644, 23288, 46576, 93152.
What is 93152 in binary?
10110101111100000 (hexadecimal 16BE0, octal 265740).
What is the square root of 93152?
About 305.2081, exactly 4√5822.
Is 93152 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 93152?
It is a composite number with 24 divisors.