The number 91991
91991 is a composite number with 4 divisors. Its prime factorisation is 67 × 1373. Divisors (4): 1, 67, 1373, 91991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91991: a semiprime: 67 × 1373, the product of two primes.
- 2
91991 is composite. Its prime factorisation is
- 3
The divisors add up to 93432; without 91991 itself that is 1441, so 91991 is deficient (1441 is less than 91991). Euler's totient φ(91991) = 90552 numbers up to 91991 share no factor with it.
- 4
The digits of 91991 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91991 = 67 \times 1373 \]
91991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 93432 |
| Euler totient φ(n) | 90552 |
| Square | 8462344081 |
| Cube | 778459494355271 |
| Square root | 303.300181 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1991 × |
91991 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and ninety-one |
| Binary (base 2) | 10110011101010111 |
| Octal (base 8) | 263527 |
| Hexadecimal (base 16) | 16757 |
| Base 3 | 11200012002 |
| As time | 91991 seconds = 25 h 33 min 11 s |
Is 91991 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91991 a prime number?
No. 91991 = 67 × 1373, so it is divisible by 67.
What are the factors of 91991?
1, 67, 1373, 91991.
What is 91991 in binary?
10110011101010111 (hexadecimal 16757, octal 263527).
What is the square root of 91991?
About 303.3002.
Is 91991 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 91991?
91991 is a semiprime: 67 × 1373, the product of two primes.