The number 91062
91062 is a composite number with 12 divisors. Its prime factorisation is 2 × × 5059. Divisors (12): 1, 2, 3, 6, 9, 18, 5059, 10118, 15177, 30354, 45531, 91062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91062: a Harshad number: divisible by its digit sum 18.
- 2
91062 is composite. Its prime factorisation is
- 3
The divisors add up to 197340; without 91062 itself that is 106278, so 91062 is abundant (106278 is more than 91062). Euler's totient φ(91062) = 30348 numbers up to 91062 share no factor with it.
- 4
The digits of 91062 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91062 = 2 \times 3^{2} \times 5059 \]91062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 197340 |
| Euler totient φ(n) | 30348 |
| Square | 8292287844 |
| Cube | 755112315650328 |
| Square root | 301.764809 (= 3√10118) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.1062 × |
91062 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and sixty-two |
| Binary (base 2) | 10110001110110110 |
| Octal (base 8) | 261666 |
| Hexadecimal (base 16) | 163B6 |
| Base 3 | 11121220200 |
| As time | 91062 seconds = 25 h 17 min 42 s |
Is 91062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91062 ÷ 2 = 45531) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91062 ÷ 3 = 30354) | 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 | Yes (91062 ÷ 6 = 15177) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91062 ÷ 9 = 10118) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91062 a prime number?
No. 91062 = 2 × × 5059, so it is divisible by 2.
What are the factors of 91062?
1, 2, 3, 6, 9, 18, 5059, 10118, 15177, 30354, 45531, 91062.
What is 91062 in binary?
10110001110110110 (hexadecimal 163B6, octal 261666).
What is the square root of 91062?
About 301.7648, exactly 3√10118.
Is 91062 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91062?
91062 is a Harshad number: divisible by its digit sum 18.