The number 91152
91152 is a composite number with 40 divisors. Its prime factorisation is × × 211. Divisors (40): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72 … 91152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91152: a Harshad number: divisible by its digit sum 18.
- 2
91152 is composite. Its prime factorisation is
- 3
The divisors add up to 262880; without 91152 itself that is 171728, so 91152 is abundant (171728 is more than 91152). Euler's totient φ(91152) = 30240 numbers up to 91152 share no factor with it.
- 4
The digits of 91152 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91152 = 2^{4} \times 3^{3} \times 211 \]91152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 262880 |
| Euler totient φ(n) | 30240 |
| Square | 8308687104 |
| Cube | 757353446903808 |
| Square root | 301.913895 (= 12√633) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1152 × |
91152 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand one hundred and fifty-two |
| Binary (base 2) | 10110010000010000 |
| Octal (base 8) | 262020 |
| Hexadecimal (base 16) | 16410 |
| Base 3 | 11122001000 |
| As time | 91152 seconds = 25 h 19 min 12 s |
Is 91152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91152 ÷ 2 = 45576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91152 ÷ 3 = 30384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91152 ÷ 4 = 22788) | 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 | Yes (91152 ÷ 6 = 15192) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (91152 ÷ 8 = 11394) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91152 ÷ 9 = 10128) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (91152 ÷ 12 = 7596) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91152 a prime number?
No. 91152 = × × 211, so it is divisible by 2.
What are the factors of 91152?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72, 108, 144, 211, 216, 422, 432, 633, 844, 1266, 1688, 1899, 2532, 3376, 3798, 5064, 5697, 7596, 10128, 11394, 15192, 22788, 30384, 45576, 91152.
What is 91152 in binary?
10110010000010000 (hexadecimal 16410, octal 262020).
What is the square root of 91152?
About 301.9139, exactly 12√633.
Is 91152 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91152?
91152 is a Harshad number: divisible by its digit sum 18.