The number 91999
91999 is a composite number with 4 divisors. Its prime factorisation is 197 × 467. Divisors (4): 1, 197, 467, 91999.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91999: a semiprime: 197 × 467, the product of two primes.
- 2
91999 is composite. Its prime factorisation is
- 3
The divisors add up to 92664; without 91999 itself that is 665, so 91999 is deficient (665 is less than 91999). Euler's totient φ(91999) = 91336 numbers up to 91999 share no factor with it.
- 4
The digits of 91999 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91999 = 197 \times 467 \]
91999 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92664 |
| Euler totient φ(n) | 91336 |
| Square | 8463816001 |
| Cube | 778662608275999 |
| Square root | 303.313369 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1999 × |
91999 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and ninety-nine |
| Binary (base 2) | 10110011101011111 |
| Octal (base 8) | 263537 |
| Hexadecimal (base 16) | 1675F |
| Base 3 | 11200012101 |
| As time | 91999 seconds = 25 h 33 min 19 s |
Is 91999 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 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91999 a prime number?
No. 91999 = 197 × 467, so it is divisible by 197.
What are the factors of 91999?
1, 197, 467, 91999.
What is 91999 in binary?
10110011101011111 (hexadecimal 1675F, octal 263537).
What is the square root of 91999?
About 303.3134.
Is 91999 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 91999?
91999 is a semiprime: 197 × 467, the product of two primes.