The number 91968
91968 is a composite number with 28 divisors. Its prime factorisation is × 3 × 479. Divisors (28): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192, 479, 958 … 91968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91968: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
91968 is composite. Its prime factorisation is
- 3
The divisors add up to 243840; without 91968 itself that is 151872, so 91968 is abundant (151872 is more than 91968). Euler's totient φ(91968) = 30592 numbers up to 91968 share no factor with it.
- 4
The digits of 91968 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91968 = 2^{6} \times 3 \times 479 \]91968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 243840 |
| Euler totient φ(n) | 30592 |
| Square | 8458113024 |
| Cube | 777875738591232 |
| Square root | 303.262263 (= 8√1437) |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.1968 × |
91968 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and sixty-eight |
| Binary (base 2) | 10110011101000000 |
| Octal (base 8) | 263500 |
| Hexadecimal (base 16) | 16740 |
| Base 3 | 11200011020 |
| As time | 91968 seconds = 25 h 32 min 48 s |
Is 91968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91968 ÷ 2 = 45984) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91968 ÷ 3 = 30656) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91968 ÷ 4 = 22992) | 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 | Yes (91968 ÷ 6 = 15328) | 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 | Yes (91968 ÷ 8 = 11496) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 | Yes (91968 ÷ 12 = 7664) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91968 a prime number?
No. 91968 = × 3 × 479, so it is divisible by 2.
What are the factors of 91968?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192, 479, 958, 1437, 1916, 2874, 3832, 5748, 7664, 11496, 15328, 22992, 30656, 45984, 91968.
What is 91968 in binary?
10110011101000000 (hexadecimal 16740, octal 263500).
What is the square root of 91968?
About 303.2623, exactly 8√1437.
Is 91968 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 91968?
91968 is a happy number: repeatedly adding the squares of its digits reaches 1.