The number 12496
12496 is a composite number with 20 divisors. Its prime factorisation is × 11 × 71. Divisors (20): 1, 2, 4, 8, 11, 16, 22, 44, 71, 88, 142, 176, 284, 568, 781, 1136 … 12496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12496: a Harshad number: divisible by its digit sum 22.
- 2
12496 is composite. Its prime factorisation is
- 3
The divisors add up to 26784; without 12496 itself that is 14288, so 12496 is abundant (14288 is more than 12496). Euler's totient φ(12496) = 5600 numbers up to 12496 share no factor with it.
- 4
The digits of 12496 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12496 = 2^{4} \times 11 \times 71 \]12496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 26784 |
| Euler totient φ(n) | 5600 |
| Square | 156150016 |
| Cube | 1951250599936 |
| Square root | 111.785509 (= 4√781) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.2496 × |
12496 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and ninety-six |
| Binary (base 2) | 11000011010000 |
| Octal (base 8) | 30320 |
| Hexadecimal (base 16) | 30D0 |
| Base 3 | 122010211 |
| As time | 12496 seconds = 3 h 28 min 16 s |
Is 12496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12496 ÷ 2 = 6248) | 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 (12496 ÷ 4 = 3124) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (12496 ÷ 8 = 1562) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12496 ÷ 11 = 1136) | 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 12496 a prime number?
No. 12496 = × 11 × 71, so it is divisible by 2.
What are the factors of 12496?
1, 2, 4, 8, 11, 16, 22, 44, 71, 88, 142, 176, 284, 568, 781, 1136, 1562, 3124, 6248, 12496.
What is 12496 in binary?
11000011010000 (hexadecimal 30D0, octal 30320).
What is the square root of 12496?
About 111.7855, exactly 4√781.
Is 12496 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 12496?
12496 is a Harshad number: divisible by its digit sum 22.