The number 10632
10632 is a composite number with 16 divisors. Its prime factorisation is × 3 × 443. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 443, 886, 1329, 1772, 2658, 3544, 5316, 10632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10632: a Harshad number: divisible by its digit sum 12.
- 2
10632 is composite. Its prime factorisation is
- 3
The divisors add up to 26640; without 10632 itself that is 16008, so 10632 is abundant (16008 is more than 10632). Euler's totient φ(10632) = 3536 numbers up to 10632 share no factor with it.
- 4
The digits of 10632 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10632 = 2^{3} \times 3 \times 443 \]10632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26640 |
| Euler totient φ(n) | 3536 |
| Square | 113039424 |
| Cube | 1201835155968 |
| Square root | 103.111590 (= 2√2658) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0632 × |
10632 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and thirty-two |
| Binary (base 2) | 10100110001000 |
| Octal (base 8) | 24610 |
| Hexadecimal (base 16) | 2988 |
| Base 3 | 112120210 |
| As time | 10632 seconds = 2 h 57 min 12 s |
Is 10632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10632 ÷ 2 = 5316) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10632 ÷ 3 = 3544) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10632 ÷ 4 = 2658) | 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 (10632 ÷ 6 = 1772) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (10632 ÷ 8 = 1329) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10632 ÷ 12 = 886) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10632 a prime number?
No. 10632 = × 3 × 443, so it is divisible by 2.
What are the factors of 10632?
1, 2, 3, 4, 6, 8, 12, 24, 443, 886, 1329, 1772, 2658, 3544, 5316, 10632.
What is 10632 in binary?
10100110001000 (hexadecimal 2988, octal 24610).
What is the square root of 10632?
About 103.1116, exactly 2√2658.
Is 10632 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10632?
10632 is a Harshad number: divisible by its digit sum 12.