The number 1232
1232 is a composite number with 20 divisors. Its prime factorisation is × 7 × 11. Divisors (20): 1, 2, 4, 7, 8, 11, 14, 16, 22, 28, 44, 56, 77, 88, 112, 154 … 1232.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1232: a Harshad number: divisible by its digit sum 8.
- 2
1232 is composite. Its prime factorisation is
- 3
The divisors add up to 2976; without 1232 itself that is 1744, so 1232 is abundant (1744 is more than 1232). Euler's totient φ(1232) = 480 numbers up to 1232 share no factor with it.
- 4
The digits of 1232 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1232 = 2^{4} \times 7 \times 11 \]1232 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 2976 |
| Euler totient φ(n) | 480 |
| Square | 1517824 |
| Cube | 1869959168 |
| Square root | 35.099858 (= 4√77) |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 26 |
| Scientific notation | 1.232 × |
1232 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and thirty-two |
| Roman numerals | MCCXXXII |
| Binary (base 2) | 10011010000 |
| Octal (base 8) | 2320 |
| Hexadecimal (base 16) | 4D0 |
| Base 3 | 1200122 |
| As time | 1232 seconds = 20 min 32 s |
Is 1232 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1232 ÷ 2 = 616) | 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 (1232 ÷ 4 = 308) | 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 | Yes (1232 ÷ 7 = 176) | 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 (1232 ÷ 8 = 154) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 (1232 ÷ 11 = 112) | 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 1232 a prime number?
No. 1232 = × 7 × 11, so it is divisible by 2.
What are the factors of 1232?
1, 2, 4, 7, 8, 11, 14, 16, 22, 28, 44, 56, 77, 88, 112, 154, 176, 308, 616, 1232.
What is 1232 in binary?
10011010000 (hexadecimal 4D0, octal 2320).
What is the square root of 1232?
About 35.0999, exactly 4√77.
What is 1232 in Roman numerals?
MCCXXXII.
Is 1232 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1232?
1232 is a Harshad number: divisible by its digit sum 8.