The number 15496
15496 is a composite number with 16 divisors. Its prime factorisation is × 13 × 149. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 149, 298, 596, 1192, 1937, 3874, 7748, 15496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15496 is composite. Its prime factorisation is
- 3
The divisors add up to 31500; without 15496 itself that is 16004, so 15496 is abundant (16004 is more than 15496). Euler's totient φ(15496) = 7104 numbers up to 15496 share no factor with it.
- 4
The digits of 15496 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15496 = 2^{3} \times 13 \times 149 \]15496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 31500 |
| Euler totient φ(n) | 7104 |
| Square | 240126016 |
| Cube | 3720992743936 |
| Square root | 124.482931 (= 2√3874) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5496 × |
15496 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-six |
| Binary (base 2) | 11110010001000 |
| Octal (base 8) | 36210 |
| Hexadecimal (base 16) | 3C88 |
| Base 3 | 210020221 |
| As time | 15496 seconds = 4 h 18 min 16 s |
Is 15496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15496 ÷ 2 = 7748) | 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 (15496 ÷ 4 = 3874) | 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 5) | 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 (15496 ÷ 8 = 1937) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 15496 a prime number?
No. 15496 = × 13 × 149, so it is divisible by 2.
What are the factors of 15496?
1, 2, 4, 8, 13, 26, 52, 104, 149, 298, 596, 1192, 1937, 3874, 7748, 15496.
What is 15496 in binary?
11110010001000 (hexadecimal 3C88, octal 36210).
What is the square root of 15496?
About 124.4829, exactly 2√3874.
Is 15496 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 15496?
It is a composite number with 16 divisors.