The number 11563
11563 is a composite number with 4 divisors. Its prime factorisation is 31 × 373. Divisors (4): 1, 31, 373, 11563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11563: a semiprime: 31 × 373, the product of two primes.
- 2
11563 is composite. Its prime factorisation is
- 3
The divisors add up to 11968; without 11563 itself that is 405, so 11563 is deficient (405 is less than 11563). Euler's totient φ(11563) = 11160 numbers up to 11563 share no factor with it.
- 4
The digits of 11563 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11563 = 31 \times 373 \]
11563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11968 |
| Euler totient φ(n) | 11160 |
| Square | 133702969 |
| Cube | 1546007430547 |
| Square root | 107.531391 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1563 × |
11563 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and sixty-three |
| Binary (base 2) | 10110100101011 |
| Octal (base 8) | 26453 |
| Hexadecimal (base 16) | 2D2B |
| Base 3 | 120212021 |
| As time | 11563 seconds = 3 h 12 min 43 s |
Is 11563 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | No (remainder 3) | 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 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11563 a prime number?
No. 11563 = 31 × 373, so it is divisible by 31.
What are the factors of 11563?
1, 31, 373, 11563.
What is 11563 in binary?
10110100101011 (hexadecimal 2D2B, octal 26453).
What is the square root of 11563?
About 107.5314.
Is 11563 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11563?
11563 is a semiprime: 31 × 373, the product of two primes.