The number 56055
56055 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 37 × 101. Divisors (16): 1, 3, 5, 15, 37, 101, 111, 185, 303, 505, 555, 1515, 3737, 11211, 18685, 56055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56055 is composite. Its prime factorisation is
- 3
The divisors add up to 93024; without 56055 itself that is 36969, so 56055 is deficient (36969 is less than 56055). Euler's totient φ(56055) = 28800 numbers up to 56055 share no factor with it.
- 4
The digits of 56055 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56055 = 3 \times 5 \times 37 \times 101 \]
56055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93024 |
| Euler totient φ(n) | 28800 |
| Square | 3142163025 |
| Cube | 176133948366375 |
| Square root | 236.759372 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6055 × |
56055 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-five |
| Binary (base 2) | 1101101011110111 |
| Octal (base 8) | 155367 |
| Hexadecimal (base 16) | DAF7 |
| Base 3 | 2211220010 |
| As time | 56055 seconds = 15 h 34 min 15 s |
Is 56055 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 (56055 ÷ 3 = 18685) | 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 (56055 ÷ 5 = 11211) | 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 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 7) | 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 | No (remainder 10) | 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 56055 a prime number?
No. 56055 = 3 × 5 × 37 × 101, so it is divisible by 3.
What are the factors of 56055?
1, 3, 5, 15, 37, 101, 111, 185, 303, 505, 555, 1515, 3737, 11211, 18685, 56055.
What is 56055 in binary?
1101101011110111 (hexadecimal DAF7, octal 155367).
What is the square root of 56055?
About 236.7594.
Is 56055 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56055?
It is a composite number with 16 divisors.