The number 91161
91161 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1447. Divisors (12): 1, 3, 7, 9, 21, 63, 1447, 4341, 10129, 13023, 30387, 91161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91161 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91161 is composite. Its prime factorisation is
- 3
The divisors add up to 150592; without 91161 itself that is 59431, so 91161 is deficient (59431 is less than 91161). Euler's totient φ(91161) = 52056 numbers up to 91161 share no factor with it.
- 4
The digits of 91161 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91161 = 3^{2} \times 7 \times 1447 \]91161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 150592 |
| Euler totient φ(n) | 52056 |
| Square | 8310327921 |
| Cube | 757577803606281 |
| Square root | 301.928800 (= 3√10129) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1161 × |
91161 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand one hundred and sixty-one |
| Binary (base 2) | 10110010000011001 |
| Octal (base 8) | 262031 |
| Hexadecimal (base 16) | 16419 |
| Base 3 | 11122001100 |
| As time | 91161 seconds = 25 h 19 min 21 s |
Is 91161 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91161 ÷ 3 = 30387) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91161 ÷ 7 = 13023) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91161 ÷ 9 = 10129) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91161 a prime number?
No. 91161 = × 7 × 1447, so it is divisible by 3.
What are the factors of 91161?
1, 3, 7, 9, 21, 63, 1447, 4341, 10129, 13023, 30387, 91161.
What is 91161 in binary?
10110010000011001 (hexadecimal 16419, octal 262031).
What is the square root of 91161?
About 301.9288, exactly 3√10129.
Is 91161 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91161?
It is a composite number with 12 divisors.