The number 90585
90585 is a composite number with 32 divisors. Its prime factorisation is × 5 × 11 × 61. Divisors (32): 1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 61, 99, 135, 165, 183, 297 … 90585.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90585: a Harshad number: divisible by its digit sum 27.
- 2
90585 is composite. Its prime factorisation is
- 3
The divisors add up to 178560; without 90585 itself that is 87975, so 90585 is deficient (87975 is less than 90585). Euler's totient φ(90585) = 43200 numbers up to 90585 share no factor with it.
- 4
The digits of 90585 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90585 = 3^{3} \times 5 \times 11 \times 61 \]90585 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 178560 |
| Euler totient φ(n) | 43200 |
| Square | 8205642225 |
| Cube | 743308100951625 |
| Square root | 300.973421 (= 3√10065) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0585 × |
90585 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and eighty-five |
| Binary (base 2) | 10110000111011001 |
| Octal (base 8) | 260731 |
| Hexadecimal (base 16) | 161D9 |
| Base 3 | 11121021000 |
| As time | 90585 seconds = 25 h 9 min 45 s |
Is 90585 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90585 ÷ 3 = 30195) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (90585 ÷ 5 = 18117) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (90585 ÷ 9 = 10065) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (90585 ÷ 11 = 8235) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90585 a prime number?
No. 90585 = × 5 × 11 × 61, so it is divisible by 3.
What are the factors of 90585?
1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 61, 99, 135, 165, 183, 297, 305, 495, 549, 671, 915, 1485, 1647, 2013, 2745, 3355, 6039, 8235, 10065, 18117, 30195, 90585.
What is 90585 in binary?
10110000111011001 (hexadecimal 161D9, octal 260731).
What is the square root of 90585?
About 300.9734, exactly 3√10065.
Is 90585 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90585?
90585 is a Harshad number: divisible by its digit sum 27.