The number 91022
91022 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 641. Divisors (8): 1, 2, 71, 142, 641, 1282, 45511, 91022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91022 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91022 is composite. Its prime factorisation is
- 3
The divisors add up to 138672; without 91022 itself that is 47650, so 91022 is deficient (47650 is less than 91022). Euler's totient φ(91022) = 44800 numbers up to 91022 share no factor with it.
- 4
The digits of 91022 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91022 = 2 \times 71 \times 641 \]
91022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 138672 |
| Euler totient φ(n) | 44800 |
| Square | 8285004484 |
| Cube | 754117678142648 |
| Square root | 301.698525 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1022 × |
91022 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and twenty-two |
| Binary (base 2) | 10110001110001110 |
| Octal (base 8) | 261616 |
| Hexadecimal (base 16) | 1638E |
| Base 3 | 11121212012 |
| As time | 91022 seconds = 25 h 17 min 2 s |
Is 91022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91022 ÷ 2 = 45511) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91022 a prime number?
No. 91022 = 2 × 71 × 641, so it is divisible by 2.
What are the factors of 91022?
1, 2, 71, 142, 641, 1282, 45511, 91022.
What is 91022 in binary?
10110001110001110 (hexadecimal 1638E, octal 261616).
What is the square root of 91022?
About 301.6985.
Is 91022 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 91022?
It is a composite number with 8 divisors.