The number 60555
60555 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 11 × 367. Divisors (16): 1, 3, 5, 11, 15, 33, 55, 165, 367, 1101, 1835, 4037, 5505, 12111, 20185, 60555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60555 is composite. Its prime factorisation is
- 3
The divisors add up to 105984; without 60555 itself that is 45429, so 60555 is deficient (45429 is less than 60555). Euler's totient φ(60555) = 29280 numbers up to 60555 share no factor with it.
- 4
The digits of 60555 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60555 = 3 \times 5 \times 11 \times 367 \]
60555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 105984 |
| Euler totient φ(n) | 29280 |
| Square | 3666908025 |
| Cube | 222049615453875 |
| Square root | 246.079256 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.0555 × |
60555 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and fifty-five |
| Binary (base 2) | 1110110010001011 |
| Octal (base 8) | 166213 |
| Hexadecimal (base 16) | EC8B |
| Base 3 | 10002001210 |
| As time | 60555 seconds = 16 h 49 min 15 s |
Is 60555 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 (60555 ÷ 3 = 20185) | 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 | Yes (60555 ÷ 5 = 12111) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 (60555 ÷ 11 = 5505) | 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 60555 a prime number?
No. 60555 = 3 × 5 × 11 × 367, so it is divisible by 3.
What are the factors of 60555?
1, 3, 5, 11, 15, 33, 55, 165, 367, 1101, 1835, 4037, 5505, 12111, 20185, 60555.
What is 60555 in binary?
1110110010001011 (hexadecimal EC8B, octal 166213).
What is the square root of 60555?
About 246.0793.
Is 60555 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 60555?
It is a composite number with 16 divisors.