The number 11032
11032 is a composite number with 16 divisors. Its prime factorisation is × 7 × 197. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 197, 394, 788, 1379, 1576, 2758, 5516, 11032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11032: a Harshad number: divisible by its digit sum 7.
- 2
11032 is composite. Its prime factorisation is
- 3
The divisors add up to 23760; without 11032 itself that is 12728, so 11032 is abundant (12728 is more than 11032). Euler's totient φ(11032) = 4704 numbers up to 11032 share no factor with it.
- 4
The digits of 11032 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11032 = 2^{3} \times 7 \times 197 \]11032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 23760 |
| Euler totient φ(n) | 4704 |
| Square | 121705024 |
| Cube | 1342649824768 |
| Square root | 105.033328 (= 2√2758) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1032 × |
11032 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and thirty-two |
| Binary (base 2) | 10101100011000 |
| Octal (base 8) | 25430 |
| Hexadecimal (base 16) | 2B18 |
| Base 3 | 120010121 |
| As time | 11032 seconds = 3 h 3 min 52 s |
Is 11032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11032 ÷ 2 = 5516) | 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 (11032 ÷ 4 = 2758) | 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 | Yes (11032 ÷ 7 = 1576) | 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 (11032 ÷ 8 = 1379) | 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 10) | 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 11032 a prime number?
No. 11032 = × 7 × 197, so it is divisible by 2.
What are the factors of 11032?
1, 2, 4, 7, 8, 14, 28, 56, 197, 394, 788, 1379, 1576, 2758, 5516, 11032.
What is 11032 in binary?
10101100011000 (hexadecimal 2B18, octal 25430).
What is the square root of 11032?
About 105.0333, exactly 2√2758.
Is 11032 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 11032?
11032 is a Harshad number: divisible by its digit sum 7.