The number 91336
91336 is a composite number with 24 divisors. Its prime factorisation is × × 233. Divisors (24): 1, 2, 4, 7, 8, 14, 28, 49, 56, 98, 196, 233, 392, 466, 932, 1631 … 91336.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91336 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91336 is composite. Its prime factorisation is
- 3
The divisors add up to 200070; without 91336 itself that is 108734, so 91336 is abundant (108734 is more than 91336). Euler's totient φ(91336) = 38976 numbers up to 91336 share no factor with it.
- 4
The digits of 91336 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91336 = 2^{3} \times 7^{2} \times 233 \]91336 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 200070 |
| Euler totient φ(n) | 38976 |
| Square | 8342264896 |
| Cube | 761949106541056 |
| Square root | 302.218464 (= 14√466) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.1336 × |
91336 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and thirty-six |
| Binary (base 2) | 10110010011001000 |
| Octal (base 8) | 262310 |
| Hexadecimal (base 16) | 164C8 |
| Base 3 | 11122021211 |
| As time | 91336 seconds = 25 h 22 min 16 s |
Is 91336 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91336 ÷ 2 = 45668) | 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 (91336 ÷ 4 = 22834) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91336 ÷ 7 = 13048) | 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 (91336 ÷ 8 = 11417) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 3) | 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 91336 a prime number?
No. 91336 = × × 233, so it is divisible by 2.
What are the factors of 91336?
1, 2, 4, 7, 8, 14, 28, 49, 56, 98, 196, 233, 392, 466, 932, 1631, 1864, 3262, 6524, 11417, 13048, 22834, 45668, 91336.
What is 91336 in binary?
10110010011001000 (hexadecimal 164C8, octal 262310).
What is the square root of 91336?
About 302.2185, exactly 14√466.
Is 91336 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91336?
It is a composite number with 24 divisors.