The number 11363
11363 is a composite number with 4 divisors. Its prime factorisation is 11 × 1033. Divisors (4): 1, 11, 1033, 11363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11363: a semiprime: 11 × 1033, the product of two primes.
- 2
11363 is composite. Its prime factorisation is
- 3
The divisors add up to 12408; without 11363 itself that is 1045, so 11363 is deficient (1045 is less than 11363). Euler's totient φ(11363) = 10320 numbers up to 11363 share no factor with it.
- 4
The digits of 11363 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11363 = 11 \times 1033 \]
11363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12408 |
| Euler totient φ(n) | 10320 |
| Square | 129117769 |
| Cube | 1467165209147 |
| Square root | 106.597373 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1363 × |
11363 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and sixty-three |
| Binary (base 2) | 10110001100011 |
| Octal (base 8) | 26143 |
| Hexadecimal (base 16) | 2C63 |
| Base 3 | 120120212 |
| As time | 11363 seconds = 3 h 9 min 23 s |
Is 11363 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 2) | 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 5) | 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 | Yes (11363 ÷ 11 = 1033) | 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 11363 a prime number?
No. 11363 = 11 × 1033, so it is divisible by 11.
What are the factors of 11363?
1, 11, 1033, 11363.
What is 11363 in binary?
10110001100011 (hexadecimal 2C63, octal 26143).
What is the square root of 11363?
About 106.5974.
Is 11363 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11363?
11363 is a semiprime: 11 × 1033, the product of two primes.