The number 91073
91073 is a composite number with 4 divisors. Its prime factorisation is 61 × 1493. Divisors (4): 1, 61, 1493, 91073.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91073: a semiprime: 61 × 1493, the product of two primes.
- 2
91073 is composite. Its prime factorisation is
- 3
The divisors add up to 92628; without 91073 itself that is 1555, so 91073 is deficient (1555 is less than 91073). Euler's totient φ(91073) = 89520 numbers up to 91073 share no factor with it.
- 4
The digits of 91073 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91073 = 61 \times 1493 \]
91073 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92628 |
| Euler totient φ(n) | 89520 |
| Square | 8294291329 |
| Cube | 755385994206017 |
| Square root | 301.783035 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.1073 × |
91073 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and seventy-three |
| Binary (base 2) | 10110001111000001 |
| Octal (base 8) | 261701 |
| Hexadecimal (base 16) | 163C1 |
| Base 3 | 11121221002 |
| As time | 91073 seconds = 25 h 17 min 53 s |
Is 91073 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91073 a prime number?
No. 91073 = 61 × 1493, so it is divisible by 61.
What are the factors of 91073?
1, 61, 1493, 91073.
What is 91073 in binary?
10110001111000001 (hexadecimal 163C1, octal 261701).
What is the square root of 91073?
About 301.7830.
Is 91073 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 91073?
91073 is a semiprime: 61 × 1493, the product of two primes.