The number 15536
15536 is a composite number with 10 divisors. Its prime factorisation is × 971. Divisors (10): 1, 2, 4, 8, 16, 971, 1942, 3884, 7768, 15536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15536 is composite. Its prime factorisation is
- 3
The divisors add up to 30132; without 15536 itself that is 14596, so 15536 is deficient (14596 is less than 15536). Euler's totient φ(15536) = 7760 numbers up to 15536 share no factor with it.
- 4
The digits of 15536 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15536 = 2^{4} \times 971 \]15536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 30132 |
| Euler totient φ(n) | 7760 |
| Square | 241367296 |
| Cube | 3749882310656 |
| Square root | 124.643492 (= 4√971) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5536 × |
15536 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and thirty-six |
| Binary (base 2) | 11110010110000 |
| Octal (base 8) | 36260 |
| Hexadecimal (base 16) | 3CB0 |
| Base 3 | 210022102 |
| As time | 15536 seconds = 4 h 18 min 56 s |
Is 15536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15536 ÷ 2 = 7768) | 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 (15536 ÷ 4 = 3884) | 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 (15536 ÷ 8 = 1942) | 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 4) | 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 15536 a prime number?
No. 15536 = × 971, so it is divisible by 2.
What are the factors of 15536?
1, 2, 4, 8, 16, 971, 1942, 3884, 7768, 15536.
What is 15536 in binary?
11110010110000 (hexadecimal 3CB0, octal 36260).
What is the square root of 15536?
About 124.6435, exactly 4√971.
Is 15536 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15536?
It is a composite number with 10 divisors.