The number 11490
11490 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 383. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 383, 766, 1149, 1915, 2298, 3830, 5745, 11490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11490: a Harshad number: divisible by its digit sum 15.
- 2
11490 is composite. Its prime factorisation is
- 3
The divisors add up to 27648; without 11490 itself that is 16158, so 11490 is abundant (16158 is more than 11490). Euler's totient φ(11490) = 3056 numbers up to 11490 share no factor with it.
- 4
The digits of 11490 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11490 = 2 \times 3 \times 5 \times 383 \]
11490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27648 |
| Euler totient φ(n) | 3056 |
| Square | 132020100 |
| Cube | 1516910949000 |
| Square root | 107.191418 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.149 × |
11490 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and ninety |
| Binary (base 2) | 10110011100010 |
| Octal (base 8) | 26342 |
| Hexadecimal (base 16) | 2CE2 |
| Base 3 | 120202120 |
| As time | 11490 seconds = 3 h 11 min 30 s |
Is 11490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11490 ÷ 2 = 5745) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11490 ÷ 3 = 3830) | 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 (11490 ÷ 5 = 2298) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11490 ÷ 6 = 1915) | 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 2) | 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 | Yes (11490 ÷ 10 = 1149) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11490 a prime number?
No. 11490 = 2 × 3 × 5 × 383, so it is divisible by 2.
What are the factors of 11490?
1, 2, 3, 5, 6, 10, 15, 30, 383, 766, 1149, 1915, 2298, 3830, 5745, 11490.
What is 11490 in binary?
10110011100010 (hexadecimal 2CE2, octal 26342).
What is the square root of 11490?
About 107.1914.
Is 11490 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11490?
11490 is a Harshad number: divisible by its digit sum 15.