The number 1650
1650 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 11. Divisors (24): 1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75 … 1650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1650 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1650 is composite. Its prime factorisation is
- 3
The divisors add up to 4464; without 1650 itself that is 2814, so 1650 is abundant (2814 is more than 1650). Euler's totient φ(1650) = 400 numbers up to 1650 share no factor with it.
- 4
The digits of 1650 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1650 = 2 \times 3 \times 5^{2} \times 11 \]1650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 4464 |
| Euler totient φ(n) | 400 |
| Square | 2722500 |
| Cube | 4492125000 |
| Square root | 40.620192 (= 5√66) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.65 × |
1650 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and fifty |
| Roman numerals | MDCL |
| Binary (base 2) | 11001110010 |
| Octal (base 8) | 3162 |
| Hexadecimal (base 16) | 672 |
| Base 3 | 2021010 |
| As time | 1650 seconds = 27 min 30 s |
Is 1650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1650 ÷ 2 = 825) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1650 ÷ 3 = 550) | 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 (1650 ÷ 5 = 330) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1650 ÷ 6 = 275) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (1650 ÷ 10 = 165) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1650 ÷ 11 = 150) | 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 1650 a prime number?
No. 1650 = 2 × 3 × × 11, so it is divisible by 2.
What are the factors of 1650?
1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75, 110, 150, 165, 275, 330, 550, 825, 1650.
What is 1650 in binary?
11001110010 (hexadecimal 672, octal 3162).
What is the square root of 1650?
About 40.6202, exactly 5√66.
What is 1650 in Roman numerals?
MDCL.
Is 1650 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1650?
It is a composite number with 24 divisors.