The number 11390
11390 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 67. Divisors (16): 1, 2, 5, 10, 17, 34, 67, 85, 134, 170, 335, 670, 1139, 2278, 5695, 11390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11390 is composite. Its prime factorisation is
- 3
The divisors add up to 22032; without 11390 itself that is 10642, so 11390 is deficient (10642 is less than 11390). Euler's totient φ(11390) = 4224 numbers up to 11390 share no factor with it.
- 4
The digits of 11390 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11390 = 2 \times 5 \times 17 \times 67 \]
11390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22032 |
| Euler totient φ(n) | 4224 |
| Square | 129732100 |
| Cube | 1477648619000 |
| Square root | 106.723943 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.139 × |
11390 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and ninety |
| Binary (base 2) | 10110001111110 |
| Octal (base 8) | 26176 |
| Hexadecimal (base 16) | 2C7E |
| Base 3 | 120121212 |
| As time | 11390 seconds = 3 h 9 min 50 s |
Is 11390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11390 ÷ 2 = 5695) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11390 ÷ 5 = 2278) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11390 ÷ 10 = 1139) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11390 a prime number?
No. 11390 = 2 × 5 × 17 × 67, so it is divisible by 2.
What are the factors of 11390?
1, 2, 5, 10, 17, 34, 67, 85, 134, 170, 335, 670, 1139, 2278, 5695, 11390.
What is 11390 in binary?
10110001111110 (hexadecimal 2C7E, octal 26176).
What is the square root of 11390?
About 106.7239.
Is 11390 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11390?
It is a composite number with 16 divisors.