The number 90558
90558 is a composite number with 40 divisors. Its prime factorisation is 2 × × 13 × 43. Divisors (40): 1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 43, 54, 78, 81, 86, 117 … 90558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90558: a Harshad number: divisible by its digit sum 27.
- 2
90558 is composite. Its prime factorisation is
- 3
The divisors add up to 223608; without 90558 itself that is 133050, so 90558 is abundant (133050 is more than 90558). Euler's totient φ(90558) = 27216 numbers up to 90558 share no factor with it.
- 4
The digits of 90558 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90558 = 2 \times 3^{4} \times 13 \times 43 \]90558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 223608 |
| Euler totient φ(n) | 27216 |
| Square | 8200751364 |
| Cube | 742643642021112 |
| Square root | 300.928563 (= 9√1118) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.0558 × |
90558 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and fifty-eight |
| Binary (base 2) | 10110000110111110 |
| Octal (base 8) | 260676 |
| Hexadecimal (base 16) | 161BE |
| Base 3 | 11121020000 |
| As time | 90558 seconds = 25 h 9 min 18 s |
Is 90558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90558 ÷ 2 = 45279) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90558 ÷ 3 = 30186) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (90558 ÷ 6 = 15093) | 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 (90558 ÷ 9 = 10062) | 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 6) | 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 90558 a prime number?
No. 90558 = 2 × × 13 × 43, so it is divisible by 2.
What are the factors of 90558?
1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 43, 54, 78, 81, 86, 117, 129, 162, 234, 258, 351, 387, 559, 702, 774, 1053, 1118, 1161, 1677, 2106, 2322, 3354, 3483, 5031, 6966, 10062, 15093, 30186, 45279, 90558.
What is 90558 in binary?
10110000110111110 (hexadecimal 161BE, octal 260676).
What is the square root of 90558?
About 300.9286, exactly 9√1118.
Is 90558 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90558?
90558 is a Harshad number: divisible by its digit sum 27.