The number 11536
11536 is a composite number with 20 divisors. Its prime factorisation is × 7 × 103. Divisors (20): 1, 2, 4, 7, 8, 14, 16, 28, 56, 103, 112, 206, 412, 721, 824, 1442 … 11536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11536: a Harshad number: divisible by its digit sum 16.
- 2
11536 is composite. Its prime factorisation is
- 3
The divisors add up to 25792; without 11536 itself that is 14256, so 11536 is abundant (14256 is more than 11536). Euler's totient φ(11536) = 4896 numbers up to 11536 share no factor with it.
- 4
The digits of 11536 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11536 = 2^{4} \times 7 \times 103 \]11536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 25792 |
| Euler totient φ(n) | 4896 |
| Square | 133079296 |
| Cube | 1535202758656 |
| Square root | 107.405773 (= 4√721) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1536 × |
11536 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and thirty-six |
| Binary (base 2) | 10110100010000 |
| Octal (base 8) | 26420 |
| Hexadecimal (base 16) | 2D10 |
| Base 3 | 120211021 |
| As time | 11536 seconds = 3 h 12 min 16 s |
Is 11536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11536 ÷ 2 = 5768) | 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 (11536 ÷ 4 = 2884) | 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 | Yes (11536 ÷ 7 = 1648) | 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 (11536 ÷ 8 = 1442) | 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 11536 a prime number?
No. 11536 = × 7 × 103, so it is divisible by 2.
What are the factors of 11536?
1, 2, 4, 7, 8, 14, 16, 28, 56, 103, 112, 206, 412, 721, 824, 1442, 1648, 2884, 5768, 11536.
What is 11536 in binary?
10110100010000 (hexadecimal 2D10, octal 26420).
What is the square root of 11536?
About 107.4058, exactly 4√721.
Is 11536 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11536?
11536 is a Harshad number: divisible by its digit sum 16.