The number 56032
56032 is a composite number with 24 divisors. Its prime factorisation is × 17 × 103. Divisors (24): 1, 2, 4, 8, 16, 17, 32, 34, 68, 103, 136, 206, 272, 412, 544, 824 … 56032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56032: a Harshad number: divisible by its digit sum 16.
- 2
56032 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 56032 itself that is 61904, so 56032 is abundant (61904 is more than 56032). Euler's totient φ(56032) = 26112 numbers up to 56032 share no factor with it.
- 4
The digits of 56032 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56032 = 2^{5} \times 17 \times 103 \]56032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 26112 |
| Square | 3139585024 |
| Cube | 175917228064768 |
| Square root | 236.710794 (= 4√3502) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6032 × |
56032 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and thirty-two |
| Binary (base 2) | 1101101011100000 |
| Octal (base 8) | 155340 |
| Hexadecimal (base 16) | DAE0 |
| Base 3 | 2211212021 |
| As time | 56032 seconds = 15 h 33 min 52 s |
Is 56032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56032 ÷ 2 = 28016) | 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 (56032 ÷ 4 = 14008) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (56032 ÷ 8 = 7004) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 9) | 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 56032 a prime number?
No. 56032 = × 17 × 103, so it is divisible by 2.
What are the factors of 56032?
1, 2, 4, 8, 16, 17, 32, 34, 68, 103, 136, 206, 272, 412, 544, 824, 1648, 1751, 3296, 3502, 7004, 14008, 28016, 56032.
What is 56032 in binary?
1101101011100000 (hexadecimal DAE0, octal 155340).
What is the square root of 56032?
About 236.7108, exactly 4√3502.
Is 56032 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 56032?
56032 is a Harshad number: divisible by its digit sum 16.