The number 11330
11330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 103. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 103, 110, 206, 515, 1030, 1133, 2266, 5665, 11330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11330 is composite. Its prime factorisation is
- 3
The divisors add up to 22464; without 11330 itself that is 11134, so 11330 is deficient (11134 is less than 11330). Euler's totient φ(11330) = 4080 numbers up to 11330 share no factor with it.
- 4
The digits of 11330 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11330 = 2 \times 5 \times 11 \times 103 \]
11330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22464 |
| Euler totient φ(n) | 4080 |
| Square | 128368900 |
| Cube | 1454419637000 |
| Square root | 106.442473 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.133 × |
11330 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and thirty |
| Binary (base 2) | 10110001000010 |
| Octal (base 8) | 26102 |
| Hexadecimal (base 16) | 2C42 |
| Base 3 | 120112122 |
| As time | 11330 seconds = 3 h 8 min 50 s |
Is 11330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11330 ÷ 2 = 5665) | 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 (11330 ÷ 5 = 2266) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11330 ÷ 10 = 1133) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (11330 ÷ 11 = 1030) | 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 11330 a prime number?
No. 11330 = 2 × 5 × 11 × 103, so it is divisible by 2.
What are the factors of 11330?
1, 2, 5, 10, 11, 22, 55, 103, 110, 206, 515, 1030, 1133, 2266, 5665, 11330.
What is 11330 in binary?
10110001000010 (hexadecimal 2C42, octal 26102).
What is the square root of 11330?
About 106.4425.
Is 11330 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 11330?
It is a composite number with 16 divisors.