The number 6050
6050 is a composite number with 18 divisors. Its prime factorisation is 2 × × . Divisors (18): 1, 2, 5, 10, 11, 22, 25, 50, 55, 110, 121, 242, 275, 550, 605, 1210 … 6050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6050: a Harshad number: divisible by its digit sum 11.
- 2
6050 is composite. Its prime factorisation is
- 3
The divisors add up to 12369; without 6050 itself that is 6319, so 6050 is abundant (6319 is more than 6050). Euler's totient φ(6050) = 2200 numbers up to 6050 share no factor with it.
- 4
The digits of 6050 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6050 = 2 \times 5^{2} \times 11^{2} \]6050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 12369 |
| Euler totient φ(n) | 2200 |
| Square | 36602500 |
| Cube | 221445125000 |
| Square root | 77.781746 (= 55√2) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 67 |
| Scientific notation | 6.05 × |
6050 in other forms
| Form | Value |
|---|---|
| In words | six thousand and fifty |
| Binary (base 2) | 1011110100010 |
| Octal (base 8) | 13642 |
| Hexadecimal (base 16) | 17A2 |
| Base 3 | 22022002 |
| As time | 6050 seconds = 1 h 40 min 50 s |
Is 6050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6050 ÷ 2 = 3025) | 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 (6050 ÷ 5 = 1210) | 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 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (6050 ÷ 10 = 605) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (6050 ÷ 11 = 550) | 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 6050 a prime number?
No. 6050 = 2 × × , so it is divisible by 2.
What are the factors of 6050?
1, 2, 5, 10, 11, 22, 25, 50, 55, 110, 121, 242, 275, 550, 605, 1210, 3025, 6050.
What is 6050 in binary?
1011110100010 (hexadecimal 17A2, octal 13642).
What is the square root of 6050?
About 77.7817, exactly 55√2.
Is 6050 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 6050?
6050 is a Harshad number: divisible by its digit sum 11.