The number 5632
5632 is a composite number with 20 divisors. Its prime factorisation is × 11. Divisors (20): 1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 88, 128, 176, 256, 352, 512 … 5632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5632: a Harshad number: divisible by its digit sum 16.
- 2
5632 is composite. Its prime factorisation is
- 3
The divisors add up to 12276; without 5632 itself that is 6644, so 5632 is abundant (6644 is more than 5632). Euler's totient φ(5632) = 2560 numbers up to 5632 share no factor with it.
- 4
The digits of 5632 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 23 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5632 = 2^{9} \times 11 \]5632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 12276 |
| Euler totient φ(n) | 2560 |
| Square | 31719424 |
| Cube | 178643795968 |
| Square root | 75.046652 (= 16√22) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 23 |
| Scientific notation | 5.632 × |
5632 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and thirty-two |
| Binary (base 2) | 1011000000000 |
| Octal (base 8) | 13000 |
| Hexadecimal (base 16) | 1600 |
| Base 3 | 21201121 |
| As time | 5632 seconds = 1 h 33 min 52 s |
Is 5632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5632 ÷ 2 = 2816) | 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 (5632 ÷ 4 = 1408) | 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 (5632 ÷ 8 = 704) | 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 | Yes (5632 ÷ 11 = 512) | 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 5632 a prime number?
No. 5632 = × 11, so it is divisible by 2.
What are the factors of 5632?
1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 88, 128, 176, 256, 352, 512, 704, 1408, 2816, 5632.
What is 5632 in binary?
1011000000000 (hexadecimal 1600, octal 13000).
What is the square root of 5632?
About 75.0467, exactly 16√22.
Is 5632 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5632?
5632 is a Harshad number: divisible by its digit sum 16.