The number 11130
11130 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 53. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105 … 11130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11130: a Harshad number: divisible by its digit sum 6.
- 2
11130 is composite. Its prime factorisation is
- 3
The divisors add up to 31104; without 11130 itself that is 19974, so 11130 is abundant (19974 is more than 11130). Euler's totient φ(11130) = 2496 numbers up to 11130 share no factor with it.
- 4
The digits of 11130 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11130 = 2 \times 3 \times 5 \times 7 \times 53 \]
11130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 31104 |
| Euler totient φ(n) | 2496 |
| Square | 123876900 |
| Cube | 1378749897000 |
| Square root | 105.498815 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.113 × |
11130 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and thirty |
| Binary (base 2) | 10101101111010 |
| Octal (base 8) | 25572 |
| Hexadecimal (base 16) | 2B7A |
| Base 3 | 120021020 |
| As time | 11130 seconds = 3 h 5 min 30 s |
Is 11130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11130 ÷ 2 = 5565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11130 ÷ 3 = 3710) | 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 (11130 ÷ 5 = 2226) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11130 ÷ 6 = 1855) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11130 ÷ 7 = 1590) | 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 (11130 ÷ 10 = 1113) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 11130 a prime number?
No. 11130 = 2 × 3 × 5 × 7 × 53, so it is divisible by 2.
What are the factors of 11130?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105, 106, 159, 210, 265, 318, 371, 530, 742, 795, 1113, 1590, 1855, 2226, 3710, 5565, 11130.
What is 11130 in binary?
10101101111010 (hexadecimal 2B7A, octal 25572).
What is the square root of 11130?
About 105.4988.
Is 11130 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 11130?
11130 is a Harshad number: divisible by its digit sum 6.