The number 13496
13496 is a composite number with 16 divisors. Its prime factorisation is × 7 × 241. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 241, 482, 964, 1687, 1928, 3374, 6748, 13496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13496 is composite. Its prime factorisation is
- 3
The divisors add up to 29040; without 13496 itself that is 15544, so 13496 is abundant (15544 is more than 13496). Euler's totient φ(13496) = 5760 numbers up to 13496 share no factor with it.
- 4
The digits of 13496 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13496 = 2^{3} \times 7 \times 241 \]13496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 29040 |
| Euler totient φ(n) | 5760 |
| Square | 182142016 |
| Cube | 2458188647936 |
| Square root | 116.172286 (= 2√3374) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3496 × |
13496 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety-six |
| Binary (base 2) | 11010010111000 |
| Octal (base 8) | 32270 |
| Hexadecimal (base 16) | 34B8 |
| Base 3 | 200111212 |
| As time | 13496 seconds = 3 h 44 min 56 s |
Is 13496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13496 ÷ 2 = 6748) | 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 (13496 ÷ 4 = 3374) | 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 | Yes (13496 ÷ 7 = 1928) | 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 (13496 ÷ 8 = 1687) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 10) | 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 13496 a prime number?
No. 13496 = × 7 × 241, so it is divisible by 2.
What are the factors of 13496?
1, 2, 4, 7, 8, 14, 28, 56, 241, 482, 964, 1687, 1928, 3374, 6748, 13496.
What is 13496 in binary?
11010010111000 (hexadecimal 34B8, octal 32270).
What is the square root of 13496?
About 116.1723, exactly 2√3374.
Is 13496 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 13496?
It is a composite number with 16 divisors.