The number 56072
56072 is a composite number with 16 divisors. Its prime factorisation is × 43 × 163. Divisors (16): 1, 2, 4, 8, 43, 86, 163, 172, 326, 344, 652, 1304, 7009, 14018, 28036, 56072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56072 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56072 is composite. Its prime factorisation is
- 3
The divisors add up to 108240; without 56072 itself that is 52168, so 56072 is deficient (52168 is less than 56072). Euler's totient φ(56072) = 27216 numbers up to 56072 share no factor with it.
- 4
The digits of 56072 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56072 = 2^{3} \times 43 \times 163 \]56072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108240 |
| Euler totient φ(n) | 27216 |
| Square | 3144069184 |
| Cube | 176294247285248 |
| Square root | 236.795270 (= 2√14018) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.6072 × |
56072 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and seventy-two |
| Binary (base 2) | 1101101100001000 |
| Octal (base 8) | 155410 |
| Hexadecimal (base 16) | DB08 |
| Base 3 | 2211220202 |
| As time | 56072 seconds = 15 h 34 min 32 s |
Is 56072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56072 ÷ 2 = 28036) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56072 ÷ 4 = 14018) | 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 | No (remainder 2) | 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 | Yes (56072 ÷ 8 = 7009) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56072 a prime number?
No. 56072 = × 43 × 163, so it is divisible by 2.
What are the factors of 56072?
1, 2, 4, 8, 43, 86, 163, 172, 326, 344, 652, 1304, 7009, 14018, 28036, 56072.
What is 56072 in binary?
1101101100001000 (hexadecimal DB08, octal 155410).
What is the square root of 56072?
About 236.7953, exactly 2√14018.
Is 56072 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56072?
It is a composite number with 16 divisors.