The number 91051
91051 is a composite number with 4 divisors. Its prime factorisation is 83 × 1097. Divisors (4): 1, 83, 1097, 91051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91051: a semiprime: 83 × 1097, the product of two primes.
- 2
91051 is composite. Its prime factorisation is
- 3
The divisors add up to 92232; without 91051 itself that is 1181, so 91051 is deficient (1181 is less than 91051). Euler's totient φ(91051) = 89872 numbers up to 91051 share no factor with it.
- 4
The digits of 91051 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91051 = 83 \times 1097 \]
91051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92232 |
| Euler totient φ(n) | 89872 |
| Square | 8290284601 |
| Cube | 754838703205651 |
| Square root | 301.746582 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1051 × |
91051 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and fifty-one |
| Binary (base 2) | 10110001110101011 |
| Octal (base 8) | 261653 |
| Hexadecimal (base 16) | 163AB |
| Base 3 | 11121220021 |
| As time | 91051 seconds = 25 h 17 min 31 s |
Is 91051 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 4) | 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 91051 a prime number?
No. 91051 = 83 × 1097, so it is divisible by 83.
What are the factors of 91051?
1, 83, 1097, 91051.
What is 91051 in binary?
10110001110101011 (hexadecimal 163AB, octal 261653).
What is the square root of 91051?
About 301.7466.
Is 91051 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91051?
91051 is a semiprime: 83 × 1097, the product of two primes.