The number 60565
60565 is a composite number with 4 divisors. Its prime factorisation is 5 × 12113. Divisors (4): 1, 5, 12113, 60565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60565: a semiprime: 5 × 12113, the product of two primes.
- 2
60565 is composite. Its prime factorisation is
- 3
The divisors add up to 72684; without 60565 itself that is 12119, so 60565 is deficient (12119 is less than 60565). Euler's totient φ(60565) = 48448 numbers up to 60565 share no factor with it.
- 4
The digits of 60565 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60565 = 5 \times 12113 \]
60565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72684 |
| Euler totient φ(n) | 48448 |
| Square | 3668119225 |
| Cube | 222159640862125 |
| Square root | 246.099573 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.0565 × |
60565 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and sixty-five |
| Binary (base 2) | 1110110010010101 |
| Octal (base 8) | 166225 |
| Hexadecimal (base 16) | EC95 |
| Base 3 | 10002002011 |
| As time | 60565 seconds = 16 h 49 min 25 s |
Is 60565 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 (60565 ÷ 5 = 12113) | 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 1) | 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 4) | 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 10) | 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 60565 a prime number?
No. 60565 = 5 × 12113, so it is divisible by 5.
What are the factors of 60565?
1, 5, 12113, 60565.
What is 60565 in binary?
1110110010010101 (hexadecimal EC95, octal 166225).
What is the square root of 60565?
About 246.0996.
Is 60565 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 60565?
60565 is a semiprime: 5 × 12113, the product of two primes.