The number 11193
11193 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 41. Divisors (16): 1, 3, 7, 13, 21, 39, 41, 91, 123, 273, 287, 533, 861, 1599, 3731, 11193.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11193 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11193 is composite. Its prime factorisation is
- 3
The divisors add up to 18816; without 11193 itself that is 7623, so 11193 is deficient (7623 is less than 11193). Euler's totient φ(11193) = 5760 numbers up to 11193 share no factor with it.
- 4
The digits of 11193 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11193 = 3 \times 7 \times 13 \times 41 \]
11193 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 18816 |
| Euler totient φ(n) | 5760 |
| Square | 125283249 |
| Cube | 1402295406057 |
| Square root | 105.796975 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1193 × |
11193 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and ninety-three |
| Binary (base 2) | 10101110111001 |
| Octal (base 8) | 25671 |
| Hexadecimal (base 16) | 2BB9 |
| Base 3 | 120100120 |
| As time | 11193 seconds = 3 h 6 min 33 s |
Is 11193 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 | Yes (11193 ÷ 3 = 3731) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11193 ÷ 7 = 1599) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11193 a prime number?
No. 11193 = 3 × 7 × 13 × 41, so it is divisible by 3.
What are the factors of 11193?
1, 3, 7, 13, 21, 39, 41, 91, 123, 273, 287, 533, 861, 1599, 3731, 11193.
What is 11193 in binary?
10101110111001 (hexadecimal 2BB9, octal 25671).
What is the square root of 11193?
About 105.7970.
Is 11193 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11193?
It is a composite number with 16 divisors.