The number 1032
1032 is a composite number with 16 divisors. Its prime factorisation is × 3 × 43. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 43, 86, 129, 172, 258, 344, 516, 1032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1032: a Harshad number: divisible by its digit sum 6.
- 2
1032 is composite. Its prime factorisation is
- 3
The divisors add up to 2640; without 1032 itself that is 1608, so 1032 is abundant (1608 is more than 1032). Euler's totient φ(1032) = 336 numbers up to 1032 share no factor with it.
- 4
The digits of 1032 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1032 = 2^{3} \times 3 \times 43 \]1032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 2640 |
| Euler totient φ(n) | 336 |
| Square | 1065024 |
| Cube | 1099104768 |
| Square root | 32.124757 (= 2√258) |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 124 |
| Scientific notation | 1.032 × |
1032 in other forms
| Form | Value |
|---|---|
| In words | one thousand and thirty-two |
| Roman numerals | MXXXII |
| Binary (base 2) | 10000001000 |
| Octal (base 8) | 2010 |
| Hexadecimal (base 16) | 408 |
| Base 3 | 1102020 |
| As time | 1032 seconds = 17 min 12 s |
Is 1032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1032 ÷ 2 = 516) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1032 ÷ 3 = 344) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1032 ÷ 4 = 258) | 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 (1032 ÷ 6 = 172) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (1032 ÷ 8 = 129) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | Yes (1032 ÷ 12 = 86) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1032 a prime number?
No. 1032 = × 3 × 43, so it is divisible by 2.
What are the factors of 1032?
1, 2, 3, 4, 6, 8, 12, 24, 43, 86, 129, 172, 258, 344, 516, 1032.
What is 1032 in binary?
10000001000 (hexadecimal 408, octal 2010).
What is the square root of 1032?
About 32.1248, exactly 2√258.
What is 1032 in Roman numerals?
MXXXII.
Is 1032 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 1032?
1032 is a Harshad number: divisible by its digit sum 6.