The number 11190
11190 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 373. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 373, 746, 1119, 1865, 2238, 3730, 5595, 11190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11190 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11190 is composite. Its prime factorisation is
- 3
The divisors add up to 26928; without 11190 itself that is 15738, so 11190 is abundant (15738 is more than 11190). Euler's totient φ(11190) = 2976 numbers up to 11190 share no factor with it.
- 4
The digits of 11190 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11190 = 2 \times 3 \times 5 \times 373 \]
11190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26928 |
| Euler totient φ(n) | 2976 |
| Square | 125216100 |
| Cube | 1401168159000 |
| Square root | 105.782796 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.119 × |
11190 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and ninety |
| Binary (base 2) | 10101110110110 |
| Octal (base 8) | 25666 |
| Hexadecimal (base 16) | 2BB6 |
| Base 3 | 120100110 |
| As time | 11190 seconds = 3 h 6 min 30 s |
Is 11190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11190 ÷ 2 = 5595) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11190 ÷ 3 = 3730) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11190 ÷ 5 = 2238) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11190 ÷ 6 = 1865) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11190 ÷ 10 = 1119) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11190 a prime number?
No. 11190 = 2 × 3 × 5 × 373, so it is divisible by 2.
What are the factors of 11190?
1, 2, 3, 5, 6, 10, 15, 30, 373, 746, 1119, 1865, 2238, 3730, 5595, 11190.
What is 11190 in binary?
10101110110110 (hexadecimal 2BB6, octal 25666).
What is the square root of 11190?
About 105.7828.
Is 11190 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11190?
It is a composite number with 16 divisors.