The number 90496
90496 is a composite number with 32 divisors. Its prime factorisation is × 7 × 101. Divisors (32): 1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 101, 112, 128, 202, 224 … 90496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90496: a Harshad number: divisible by its digit sum 28.
- 2
90496 is composite. Its prime factorisation is
- 3
The divisors add up to 208080; without 90496 itself that is 117584, so 90496 is abundant (117584 is more than 90496). Euler's totient φ(90496) = 38400 numbers up to 90496 share no factor with it.
- 4
The digits of 90496 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90496 = 2^{7} \times 7 \times 101 \]90496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 208080 |
| Euler totient φ(n) | 38400 |
| Square | 8189526016 |
| Cube | 741119346343936 |
| Square root | 300.825531 (= 8√1414) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.0496 × |
90496 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and ninety-six |
| Binary (base 2) | 10110000110000000 |
| Octal (base 8) | 260600 |
| Hexadecimal (base 16) | 16180 |
| Base 3 | 11121010201 |
| As time | 90496 seconds = 25 h 8 min 16 s |
Is 90496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90496 ÷ 2 = 45248) | 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 (90496 ÷ 4 = 22624) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (90496 ÷ 7 = 12928) | 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 (90496 ÷ 8 = 11312) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 90496 a prime number?
No. 90496 = × 7 × 101, so it is divisible by 2.
What are the factors of 90496?
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 101, 112, 128, 202, 224, 404, 448, 707, 808, 896, 1414, 1616, 2828, 3232, 5656, 6464, 11312, 12928, 22624, 45248, 90496.
What is 90496 in binary?
10110000110000000 (hexadecimal 16180, octal 260600).
What is the square root of 90496?
About 300.8255, exactly 8√1414.
Is 90496 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 90496?
90496 is a Harshad number: divisible by its digit sum 28.