The number 60567
60567 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1553. Divisors (8): 1, 3, 13, 39, 1553, 4659, 20189, 60567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60567 is composite. Its prime factorisation is
- 3
The divisors add up to 87024; without 60567 itself that is 26457, so 60567 is deficient (26457 is less than 60567). Euler's totient φ(60567) = 37248 numbers up to 60567 share no factor with it.
- 4
The digits of 60567 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60567 = 3 \times 13 \times 1553 \]
60567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 87024 |
| Euler totient φ(n) | 37248 |
| Square | 3668361489 |
| Cube | 222181650304263 |
| Square root | 246.103637 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.0567 × |
60567 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and sixty-seven |
| Binary (base 2) | 1110110010010111 |
| Octal (base 8) | 166227 |
| Hexadecimal (base 16) | EC97 |
| Base 3 | 10002002020 |
| As time | 60567 seconds = 16 h 49 min 27 s |
Is 60567 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 (60567 ÷ 3 = 20189) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60567 a prime number?
No. 60567 = 3 × 13 × 1553, so it is divisible by 3.
What are the factors of 60567?
1, 3, 13, 39, 1553, 4659, 20189, 60567.
What is 60567 in binary?
1110110010010111 (hexadecimal EC97, octal 166227).
What is the square root of 60567?
About 246.1036.
Is 60567 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 60567?
It is a composite number with 8 divisors.