The number 1632
1632 is a composite number with 24 divisors. Its prime factorisation is × 3 × 17. Divisors (24): 1, 2, 3, 4, 6, 8, 12, 16, 17, 24, 32, 34, 48, 51, 68, 96 … 1632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1632: a Harshad number: divisible by its digit sum 12.
- 2
1632 is composite. Its prime factorisation is
- 3
The divisors add up to 4536; without 1632 itself that is 2904, so 1632 is abundant (2904 is more than 1632). Euler's totient φ(1632) = 512 numbers up to 1632 share no factor with it.
- 4
The digits of 1632 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1632 = 2^{5} \times 3 \times 17 \]1632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 4536 |
| Euler totient φ(n) | 512 |
| Square | 2663424 |
| Cube | 4346707968 |
| Square root | 40.398020 (= 4√102) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.632 × |
1632 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and thirty-two |
| Roman numerals | MDCXXXII |
| Binary (base 2) | 11001100000 |
| Octal (base 8) | 3140 |
| Hexadecimal (base 16) | 660 |
| Base 3 | 2020110 |
| As time | 1632 seconds = 27 min 12 s |
Is 1632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1632 ÷ 2 = 816) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1632 ÷ 3 = 544) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1632 ÷ 4 = 408) | 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 (1632 ÷ 6 = 272) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (1632 ÷ 8 = 204) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (1632 ÷ 12 = 136) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1632 a prime number?
No. 1632 = × 3 × 17, so it is divisible by 2.
What are the factors of 1632?
1, 2, 3, 4, 6, 8, 12, 16, 17, 24, 32, 34, 48, 51, 68, 96, 102, 136, 204, 272, 408, 544, 816, 1632.
What is 1632 in binary?
11001100000 (hexadecimal 660, octal 3140).
What is the square root of 1632?
About 40.3980, exactly 4√102.
What is 1632 in Roman numerals?
MDCXXXII.
Is 1632 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1632?
1632 is a Harshad number: divisible by its digit sum 12.