The number 91600
91600 is a composite number with 30 divisors. Its prime factorisation is × × 229. Divisors (30): 1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 229, 400 … 91600.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91600: a Harshad number: divisible by its digit sum 16.
- 2
91600 is composite. Its prime factorisation is
- 3
The divisors add up to 221030; without 91600 itself that is 129430, so 91600 is abundant (129430 is more than 91600). Euler's totient φ(91600) = 36480 numbers up to 91600 share no factor with it.
- 4
The digits of 91600 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 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91600 = 2^{4} \times 5^{2} \times 229 \]91600 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 221030 |
| Euler totient φ(n) | 36480 |
| Square | 8390560000 |
| Cube | 768575296000000 |
| Square root | 302.654919 (= 20√229) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.16 × |
91600 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand six hundred |
| Binary (base 2) | 10110010111010000 |
| Octal (base 8) | 262720 |
| Hexadecimal (base 16) | 165D0 |
| Base 3 | 11122122121 |
| As time | 91600 seconds = 25 h 26 min 40 s |
Is 91600 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91600 ÷ 2 = 45800) | 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 | Yes (91600 ÷ 4 = 22900) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (91600 ÷ 5 = 18320) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (91600 ÷ 8 = 11450) | 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 | Yes (91600 ÷ 10 = 9160) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91600 a prime number?
No. 91600 = × × 229, so it is divisible by 2.
What are the factors of 91600?
1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 229, 400, 458, 916, 1145, 1832, 2290, 3664, 4580, 5725, 9160, 11450, 18320, 22900, 45800, 91600.
What is 91600 in binary?
10110010111010000 (hexadecimal 165D0, octal 262720).
What is the square root of 91600?
About 302.6549, exactly 20√229.
Is 91600 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91600?
91600 is a Harshad number: divisible by its digit sum 16.