The number 11063
11063 is a composite number with 8 divisors. Its prime factorisation is 13 × 23 × 37. Divisors (8): 1, 13, 23, 37, 299, 481, 851, 11063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11063 is composite. Its prime factorisation is
- 3
The divisors add up to 12768; without 11063 itself that is 1705, so 11063 is deficient (1705 is less than 11063). Euler's totient φ(11063) = 9504 numbers up to 11063 share no factor with it.
- 4
The digits of 11063 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11063 = 13 \times 23 \times 37 \]
11063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12768 |
| Euler totient φ(n) | 9504 |
| Square | 122389969 |
| Cube | 1354000227047 |
| Square root | 105.180797 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1063 × |
11063 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and sixty-three |
| Binary (base 2) | 10101100110111 |
| Octal (base 8) | 25467 |
| Hexadecimal (base 16) | 2B37 |
| Base 3 | 120011202 |
| As time | 11063 seconds = 3 h 4 min 23 s |
Is 11063 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 2) | 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 5) | 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 | No (remainder 7) | 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 3) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11063 a prime number?
No. 11063 = 13 × 23 × 37, so it is divisible by 13.
What are the factors of 11063?
1, 13, 23, 37, 299, 481, 851, 11063.
What is 11063 in binary?
10101100110111 (hexadecimal 2B37, octal 25467).
What is the square root of 11063?
About 105.1808.
Is 11063 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 11063?
It is a composite number with 8 divisors.