The number 91132
91132 is a composite number with 6 divisors. Its prime factorisation is × 22783. Divisors (6): 1, 2, 4, 22783, 45566, 91132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91132 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91132 is composite. Its prime factorisation is
- 3
The divisors add up to 159488; without 91132 itself that is 68356, so 91132 is deficient (68356 is less than 91132). Euler's totient φ(91132) = 45564 numbers up to 91132 share no factor with it.
- 4
The digits of 91132 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91132 = 2^{2} \times 22783 \]91132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 159488 |
| Euler totient φ(n) | 45564 |
| Square | 8305041424 |
| Cube | 756855035051968 |
| Square root | 301.880771 (= 2√22783) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.1132 × |
91132 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand one hundred and thirty-two |
| Binary (base 2) | 10110001111111100 |
| Octal (base 8) | 261774 |
| Hexadecimal (base 16) | 163FC |
| Base 3 | 11122000021 |
| As time | 91132 seconds = 25 h 18 min 52 s |
Is 91132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91132 ÷ 2 = 45566) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91132 ÷ 4 = 22783) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91132 a prime number?
No. 91132 = × 22783, so it is divisible by 2.
What are the factors of 91132?
1, 2, 4, 22783, 45566, 91132.
What is 91132 in binary?
10110001111111100 (hexadecimal 163FC, octal 261774).
What is the square root of 91132?
About 301.8808, exactly 2√22783.
Is 91132 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91132?
It is a composite number with 6 divisors.