The number 11010
11010 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 367. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 367, 734, 1101, 1835, 2202, 3670, 5505, 11010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11010: a Harshad number: divisible by its digit sum 3.
- 2
11010 is composite. Its prime factorisation is
- 3
The divisors add up to 26496; without 11010 itself that is 15486, so 11010 is abundant (15486 is more than 11010). Euler's totient φ(11010) = 2928 numbers up to 11010 share no factor with it.
- 4
The digits of 11010 add up to 3, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11010 = 2 \times 3 \times 5 \times 367 \]
11010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26496 |
| Euler totient φ(n) | 2928 |
| Square | 121220100 |
| Cube | 1334633301000 |
| Square root | 104.928547 |
| Digit sum / digital root | 3 / 3 |
| Collatz steps to 1 | 192 |
| Scientific notation | 1.101 × |
11010 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and ten |
| Binary (base 2) | 10101100000010 |
| Octal (base 8) | 25402 |
| Hexadecimal (base 16) | 2B02 |
| Base 3 | 120002210 |
| As time | 11010 seconds = 3 h 3 min 30 s |
Is 11010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11010 ÷ 2 = 5505) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11010 ÷ 3 = 3670) | 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 (11010 ÷ 5 = 2202) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11010 ÷ 6 = 1835) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11010 ÷ 10 = 1101) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 11010 a prime number?
No. 11010 = 2 × 3 × 5 × 367, so it is divisible by 2.
What are the factors of 11010?
1, 2, 3, 5, 6, 10, 15, 30, 367, 734, 1101, 1835, 2202, 3670, 5505, 11010.
What is 11010 in binary?
10101100000010 (hexadecimal 2B02, octal 25402).
What is the square root of 11010?
About 104.9285.
Is 11010 divisible by 3?
Yes. Its digits add up to 3, a multiple of 3.
What is special about the number 11010?
11010 is a Harshad number: divisible by its digit sum 3.