The number 91093
91093 is a composite number with 4 divisors. Its prime factorisation is 71 × 1283. Divisors (4): 1, 71, 1283, 91093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91093: a semiprime: 71 × 1283, the product of two primes.
- 2
91093 is composite. Its prime factorisation is
- 3
The divisors add up to 92448; without 91093 itself that is 1355, so 91093 is deficient (1355 is less than 91093). Euler's totient φ(91093) = 89740 numbers up to 91093 share no factor with it.
- 4
The digits of 91093 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91093 = 71 \times 1283 \]
91093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92448 |
| Euler totient φ(n) | 89740 |
| Square | 8297934649 |
| Cube | 755883760981357 |
| Square root | 301.816169 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1093 × |
91093 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and ninety-three |
| Binary (base 2) | 10110001111010101 |
| Octal (base 8) | 261725 |
| Hexadecimal (base 16) | 163D5 |
| Base 3 | 11121221211 |
| As time | 91093 seconds = 25 h 18 min 13 s |
Is 91093 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91093 a prime number?
No. 91093 = 71 × 1283, so it is divisible by 71.
What are the factors of 91093?
1, 71, 1283, 91093.
What is 91093 in binary?
10110001111010101 (hexadecimal 163D5, octal 261725).
What is the square root of 91093?
About 301.8162.
Is 91093 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91093?
91093 is a semiprime: 71 × 1283, the product of two primes.