The number 91962
91962 is a composite number with 32 divisors. Its prime factorisation is 2 × × 13 × 131. Divisors (32): 1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 78, 117, 131, 234, 262 … 91962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91962: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
91962 is composite. Its prime factorisation is
- 3
The divisors add up to 221760; without 91962 itself that is 129798, so 91962 is abundant (129798 is more than 91962). Euler's totient φ(91962) = 28080 numbers up to 91962 share no factor with it.
- 4
The digits of 91962 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91962 = 2 \times 3^{3} \times 13 \times 131 \]91962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 221760 |
| Euler totient φ(n) | 28080 |
| Square | 8457009444 |
| Cube | 777723502489128 |
| Square root | 303.252370 (= 3√10218) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.1962 × |
91962 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and sixty-two |
| Binary (base 2) | 10110011100111010 |
| Octal (base 8) | 263472 |
| Hexadecimal (base 16) | 1673A |
| Base 3 | 11200011000 |
| As time | 91962 seconds = 25 h 32 min 42 s |
Is 91962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91962 ÷ 2 = 45981) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91962 ÷ 3 = 30654) | 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 (91962 ÷ 6 = 15327) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91962 ÷ 9 = 10218) | 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 2) | 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 91962 a prime number?
No. 91962 = 2 × × 13 × 131, so it is divisible by 2.
What are the factors of 91962?
1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 78, 117, 131, 234, 262, 351, 393, 702, 786, 1179, 1703, 2358, 3406, 3537, 5109, 7074, 10218, 15327, 30654, 45981, 91962.
What is 91962 in binary?
10110011100111010 (hexadecimal 1673A, octal 263472).
What is the square root of 91962?
About 303.2524, exactly 3√10218.
Is 91962 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 91962?
91962 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.