The number 90565
90565 is a composite number with 8 divisors. Its prime factorisation is 5 × 59 × 307. Divisors (8): 1, 5, 59, 295, 307, 1535, 18113, 90565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90565: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90565 is composite. Its prime factorisation is
- 3
The divisors add up to 110880; without 90565 itself that is 20315, so 90565 is deficient (20315 is less than 90565). Euler's totient φ(90565) = 70992 numbers up to 90565 share no factor with it.
- 4
The digits of 90565 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90565 = 5 \times 59 \times 307 \]
90565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 110880 |
| Euler totient φ(n) | 70992 |
| Square | 8202019225 |
| Cube | 742815871112125 |
| Square root | 300.940193 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.0565 × |
90565 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and sixty-five |
| Binary (base 2) | 10110000111000101 |
| Octal (base 8) | 260705 |
| Hexadecimal (base 16) | 161C5 |
| Base 3 | 11121020021 |
| As time | 90565 seconds = 25 h 9 min 25 s |
Is 90565 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 | No (remainder 1) | 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 (90565 ÷ 5 = 18113) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | 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 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90565 a prime number?
No. 90565 = 5 × 59 × 307, so it is divisible by 5.
What are the factors of 90565?
1, 5, 59, 295, 307, 1535, 18113, 90565.
What is 90565 in binary?
10110000111000101 (hexadecimal 161C5, octal 260705).
What is the square root of 90565?
About 300.9402.
Is 90565 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 90565?
90565 is a happy number: repeatedly adding the squares of its digits reaches 1.