The number 12832
12832 is a composite number with 12 divisors. Its prime factorisation is × 401. Divisors (12): 1, 2, 4, 8, 16, 32, 401, 802, 1604, 3208, 6416, 12832.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12832: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
12832 is composite. Its prime factorisation is
- 3
The divisors add up to 25326; without 12832 itself that is 12494, so 12832 is deficient (12494 is less than 12832). Euler's totient φ(12832) = 6400 numbers up to 12832 share no factor with it.
- 4
The digits of 12832 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12832 = 2^{5} \times 401 \]12832 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 25326 |
| Euler totient φ(n) | 6400 |
| Square | 164660224 |
| Cube | 2112919994368 |
| Square root | 113.278418 (= 4√802) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 24 |
| Scientific notation | 1.2832 × |
12832 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand eight hundred and thirty-two |
| Binary (base 2) | 11001000100000 |
| Octal (base 8) | 31040 |
| Hexadecimal (base 16) | 3220 |
| Base 3 | 122121021 |
| As time | 12832 seconds = 3 h 33 min 52 s |
Is 12832 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12832 ÷ 2 = 6416) | 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 (12832 ÷ 4 = 3208) | 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 | 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 (12832 ÷ 8 = 1604) | 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 6) | 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 12832 a prime number?
No. 12832 = × 401, so it is divisible by 2.
What are the factors of 12832?
1, 2, 4, 8, 16, 32, 401, 802, 1604, 3208, 6416, 12832.
What is 12832 in binary?
11001000100000 (hexadecimal 3220, octal 31040).
What is the square root of 12832?
About 113.2784, exactly 4√802.
Is 12832 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12832?
12832 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.