The number 91391
91391 is a composite number with 4 divisors. Its prime factorisation is 59 × 1549. Divisors (4): 1, 59, 1549, 91391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91391: a semiprime: 59 × 1549, the product of two primes.
- 2
91391 is composite. Its prime factorisation is
- 3
The divisors add up to 93000; without 91391 itself that is 1609, so 91391 is deficient (1609 is less than 91391). Euler's totient φ(91391) = 89784 numbers up to 91391 share no factor with it.
- 4
The digits of 91391 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91391 = 59 \times 1549 \]
91391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 93000 |
| Euler totient φ(n) | 89784 |
| Square | 8352314881 |
| Cube | 763326409289471 |
| Square root | 302.309444 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.1391 × |
91391 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and ninety-one |
| Binary (base 2) | 10110010011111111 |
| Octal (base 8) | 262377 |
| Hexadecimal (base 16) | 164FF |
| Base 3 | 11122100212 |
| As time | 91391 seconds = 25 h 23 min 11 s |
Is 91391 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 6) | 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 5) | 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 3) | 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 91391 a prime number?
No. 91391 = 59 × 1549, so it is divisible by 59.
What are the factors of 91391?
1, 59, 1549, 91391.
What is 91391 in binary?
10110010011111111 (hexadecimal 164FF, octal 262377).
What is the square root of 91391?
About 302.3094.
Is 91391 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91391?
91391 is a semiprime: 59 × 1549, the product of two primes.