The number 1050
1050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 7. Divisors (24): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 70 … 1050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1050: a Harshad number: divisible by its digit sum 6.
- 2
1050 is composite. Its prime factorisation is
- 3
The divisors add up to 2976; without 1050 itself that is 1926, so 1050 is abundant (1926 is more than 1050). Euler's totient φ(1050) = 240 numbers up to 1050 share no factor with it.
- 4
The digits of 1050 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1050 = 2 \times 3 \times 5^{2} \times 7 \]1050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 2976 |
| Euler totient φ(n) | 240 |
| Square | 1102500 |
| Cube | 1157625000 |
| Square root | 32.403703 (= 5√42) |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.05 × |
1050 in other forms
| Form | Value |
|---|---|
| In words | one thousand and fifty |
| Roman numerals | ML |
| Binary (base 2) | 10000011010 |
| Octal (base 8) | 2032 |
| Hexadecimal (base 16) | 41A |
| Base 3 | 1102220 |
| As time | 1050 seconds = 17 min 30 s |
Is 1050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1050 ÷ 2 = 525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1050 ÷ 3 = 350) | 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 (1050 ÷ 5 = 210) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1050 ÷ 6 = 175) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1050 ÷ 7 = 150) | 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 (1050 ÷ 10 = 105) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 1050 a prime number?
No. 1050 = 2 × 3 × × 7, so it is divisible by 2.
What are the factors of 1050?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 70, 75, 105, 150, 175, 210, 350, 525, 1050.
What is 1050 in binary?
10000011010 (hexadecimal 41A, octal 2032).
What is the square root of 1050?
About 32.4037, exactly 5√42.
What is 1050 in Roman numerals?
ML.
Is 1050 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 1050?
1050 is a Harshad number: divisible by its digit sum 6.