The number 53055
53055 is a composite number with 20 divisors. Its prime factorisation is × 5 × 131. Divisors (20): 1, 3, 5, 9, 15, 27, 45, 81, 131, 135, 393, 405, 655, 1179, 1965, 3537 … 53055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53055 is composite. Its prime factorisation is
- 3
The divisors add up to 95832; without 53055 itself that is 42777, so 53055 is deficient (42777 is less than 53055). Euler's totient φ(53055) = 28080 numbers up to 53055 share no factor with it.
- 4
The digits of 53055 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53055 = 3^{4} \times 5 \times 131 \]53055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 95832 |
| Euler totient φ(n) | 28080 |
| Square | 2814833025 |
| Cube | 149340966141375 |
| Square root | 230.336710 (= 9√655) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3055 × |
53055 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-five |
| Binary (base 2) | 1100111100111111 |
| Octal (base 8) | 147477 |
| Hexadecimal (base 16) | CF3F |
| Base 3 | 2200210000 |
| As time | 53055 seconds = 14 h 44 min 15 s |
Is 53055 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 (53055 ÷ 3 = 17685) | 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 (53055 ÷ 5 = 10611) | 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 2) | 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 | Yes (53055 ÷ 9 = 5895) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53055 a prime number?
No. 53055 = × 5 × 131, so it is divisible by 3.
What are the factors of 53055?
1, 3, 5, 9, 15, 27, 45, 81, 131, 135, 393, 405, 655, 1179, 1965, 3537, 5895, 10611, 17685, 53055.
What is 53055 in binary?
1100111100111111 (hexadecimal CF3F, octal 147477).
What is the square root of 53055?
About 230.3367, exactly 9√655.
Is 53055 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53055?
It is a composite number with 20 divisors.