The number 11290
11290 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1129. Divisors (8): 1, 2, 5, 10, 1129, 2258, 5645, 11290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11290 is composite. Its prime factorisation is
- 3
The divisors add up to 20340; without 11290 itself that is 9050, so 11290 is deficient (9050 is less than 11290). Euler's totient φ(11290) = 4512 numbers up to 11290 share no factor with it.
- 4
The digits of 11290 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11290 = 2 \times 5 \times 1129 \]
11290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20340 |
| Euler totient φ(n) | 4512 |
| Square | 127464100 |
| Cube | 1439069689000 |
| Square root | 106.254412 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.129 × |
11290 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and ninety |
| Binary (base 2) | 10110000011010 |
| Octal (base 8) | 26032 |
| Hexadecimal (base 16) | 2C1A |
| Base 3 | 120111011 |
| As time | 11290 seconds = 3 h 8 min 10 s |
Is 11290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11290 ÷ 2 = 5645) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (11290 ÷ 5 = 2258) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11290 ÷ 10 = 1129) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11290 a prime number?
No. 11290 = 2 × 5 × 1129, so it is divisible by 2.
What are the factors of 11290?
1, 2, 5, 10, 1129, 2258, 5645, 11290.
What is 11290 in binary?
10110000011010 (hexadecimal 2C1A, octal 26032).
What is the square root of 11290?
About 106.2544.
Is 11290 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11290?
It is a composite number with 8 divisors.