The number 91971
91971 is a composite number with 12 divisors. Its prime factorisation is × 11 × 929. Divisors (12): 1, 3, 9, 11, 33, 99, 929, 2787, 8361, 10219, 30657, 91971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91971 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91971 is composite. Its prime factorisation is
- 3
The divisors add up to 145080; without 91971 itself that is 53109, so 91971 is deficient (53109 is less than 91971). Euler's totient φ(91971) = 55680 numbers up to 91971 share no factor with it.
- 4
The digits of 91971 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91971 = 3^{2} \times 11 \times 929 \]91971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 145080 |
| Euler totient φ(n) | 55680 |
| Square | 8458664841 |
| Cube | 777951864091611 |
| Square root | 303.267209 (= 3√10219) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1971 × |
91971 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and seventy-one |
| Binary (base 2) | 10110011101000011 |
| Octal (base 8) | 263503 |
| Hexadecimal (base 16) | 16743 |
| Base 3 | 11200011100 |
| As time | 91971 seconds = 25 h 32 min 51 s |
Is 91971 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 (91971 ÷ 3 = 30657) | 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 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91971 ÷ 9 = 10219) | 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 | Yes (91971 ÷ 11 = 8361) | 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 91971 a prime number?
No. 91971 = × 11 × 929, so it is divisible by 3.
What are the factors of 91971?
1, 3, 9, 11, 33, 99, 929, 2787, 8361, 10219, 30657, 91971.
What is 91971 in binary?
10110011101000011 (hexadecimal 16743, octal 263503).
What is the square root of 91971?
About 303.2672, exactly 3√10219.
Is 91971 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 91971?
It is a composite number with 12 divisors.