The number 91071
91071 is a composite number with 8 divisors. Its prime factorisation is × 3373. Divisors (8): 1, 3, 9, 27, 3373, 10119, 30357, 91071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91071 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91071 is composite. Its prime factorisation is
- 3
The divisors add up to 134960; without 91071 itself that is 43889, so 91071 is deficient (43889 is less than 91071). Euler's totient φ(91071) = 60696 numbers up to 91071 share no factor with it.
- 4
The digits of 91071 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 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91071 = 3^{3} \times 3373 \]91071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 134960 |
| Euler totient φ(n) | 60696 |
| Square | 8293927041 |
| Cube | 755336229550911 |
| Square root | 301.779721 (= 3√10119) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.1071 × |
91071 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and seventy-one |
| Binary (base 2) | 10110001110111111 |
| Octal (base 8) | 261677 |
| Hexadecimal (base 16) | 163BF |
| Base 3 | 11121221000 |
| As time | 91071 seconds = 25 h 17 min 51 s |
Is 91071 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 (91071 ÷ 3 = 30357) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91071 ÷ 9 = 10119) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91071 a prime number?
No. 91071 = × 3373, so it is divisible by 3.
What are the factors of 91071?
1, 3, 9, 27, 3373, 10119, 30357, 91071.
What is 91071 in binary?
10110001110111111 (hexadecimal 163BF, octal 261677).
What is the square root of 91071?
About 301.7797, exactly 3√10119.
Is 91071 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91071?
It is a composite number with 8 divisors.