The number 56056
56056 is a composite number with 48 divisors. Its prime factorisation is × × 11 × 13. Divisors (48): 1, 2, 4, 7, 8, 11, 13, 14, 22, 26, 28, 44, 49, 52, 56, 77 … 56056.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56056: a Harshad number: divisible by its digit sum 22.
- 2
56056 is composite. Its prime factorisation is
- 3
The divisors add up to 143640; without 56056 itself that is 87584, so 56056 is abundant (87584 is more than 56056). Euler's totient φ(56056) = 20160 numbers up to 56056 share no factor with it.
- 4
The digits of 56056 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56056 = 2^{3} \times 7^{2} \times 11 \times 13 \]56056 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 143640 |
| Euler totient φ(n) | 20160 |
| Square | 3142275136 |
| Cube | 176143375023616 |
| Square root | 236.761483 (= 14√286) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6056 × |
56056 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-six |
| Binary (base 2) | 1101101011111000 |
| Octal (base 8) | 155370 |
| Hexadecimal (base 16) | DAF8 |
| Base 3 | 2211220011 |
| As time | 56056 seconds = 15 h 34 min 16 s |
Is 56056 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56056 ÷ 2 = 28028) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56056 ÷ 4 = 14014) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56056 ÷ 7 = 8008) | 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 | Yes (56056 ÷ 8 = 7007) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56056 ÷ 11 = 5096) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56056 a prime number?
No. 56056 = × × 11 × 13, so it is divisible by 2.
What are the factors of 56056?
1, 2, 4, 7, 8, 11, 13, 14, 22, 26, 28, 44, 49, 52, 56, 77, 88, 91, 98, 104, 143, 154, 182, 196, 286, 308, 364, 392, 539, 572, 616, 637, 728, 1001, 1078, 1144, 1274, 2002, 2156, 2548, 4004, 4312, 5096, 7007, 8008, 14014, 28028, 56056.
What is 56056 in binary?
1101101011111000 (hexadecimal DAF8, octal 155370).
What is the square root of 56056?
About 236.7615, exactly 14√286.
Is 56056 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56056?
56056 is a Harshad number: divisible by its digit sum 22.