The number 56052
56052 is a composite number with 30 divisors. Its prime factorisation is × × 173. Divisors (30): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 173, 324 … 56052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56052: a Harshad number: divisible by its digit sum 18.
- 2
56052 is composite. Its prime factorisation is
- 3
The divisors add up to 147378; without 56052 itself that is 91326, so 56052 is abundant (91326 is more than 56052). Euler's totient φ(56052) = 18576 numbers up to 56052 share no factor with it.
- 4
The digits of 56052 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56052 = 2^{2} \times 3^{4} \times 173 \]56052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 147378 |
| Euler totient φ(n) | 18576 |
| Square | 3141826704 |
| Cube | 176105670412608 |
| Square root | 236.753036 (= 18√173) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6052 × |
56052 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-two |
| Binary (base 2) | 1101101011110100 |
| Octal (base 8) | 155364 |
| Hexadecimal (base 16) | DAF4 |
| Base 3 | 2211220000 |
| As time | 56052 seconds = 15 h 34 min 12 s |
Is 56052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56052 ÷ 2 = 28026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56052 ÷ 3 = 18684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56052 ÷ 4 = 14013) | 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 | Yes (56052 ÷ 6 = 9342) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56052 ÷ 9 = 6228) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56052 ÷ 12 = 4671) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56052 a prime number?
No. 56052 = × × 173, so it is divisible by 2.
What are the factors of 56052?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 173, 324, 346, 519, 692, 1038, 1557, 2076, 3114, 4671, 6228, 9342, 14013, 18684, 28026, 56052.
What is 56052 in binary?
1101101011110100 (hexadecimal DAF4, octal 155364).
What is the square root of 56052?
About 236.7530, exactly 18√173.
Is 56052 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 56052?
56052 is a Harshad number: divisible by its digit sum 18.