The number 10496
10496 is a composite number with 18 divisors. Its prime factorisation is × 41. Divisors (18): 1, 2, 4, 8, 16, 32, 41, 64, 82, 128, 164, 256, 328, 656, 1312, 2624 … 10496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10496 is composite. Its prime factorisation is
- 3
The divisors add up to 21462; without 10496 itself that is 10966, so 10496 is abundant (10966 is more than 10496). Euler's totient φ(10496) = 5120 numbers up to 10496 share no factor with it.
- 4
The digits of 10496 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10496 = 2^{8} \times 41 \]10496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 21462 |
| Euler totient φ(n) | 5120 |
| Square | 110166016 |
| Cube | 1156302503936 |
| Square root | 102.449988 (= 16√41) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.0496 × |
10496 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and ninety-six |
| Binary (base 2) | 10100100000000 |
| Octal (base 8) | 24400 |
| Hexadecimal (base 16) | 2900 |
| Base 3 | 112101202 |
| As time | 10496 seconds = 2 h 54 min 56 s |
Is 10496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10496 ÷ 2 = 5248) | 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 (10496 ÷ 4 = 2624) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (10496 ÷ 8 = 1312) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | No (remainder 2) | 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 10496 a prime number?
No. 10496 = × 41, so it is divisible by 2.
What are the factors of 10496?
1, 2, 4, 8, 16, 32, 41, 64, 82, 128, 164, 256, 328, 656, 1312, 2624, 5248, 10496.
What is 10496 in binary?
10100100000000 (hexadecimal 2900, octal 24400).
What is the square root of 10496?
About 102.4500, exactly 16√41.
Is 10496 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 10496?
It is a composite number with 18 divisors.