The number 1550
1550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 31. Divisors (12): 1, 2, 5, 10, 25, 31, 50, 62, 155, 310, 775, 1550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1550 is composite. Its prime factorisation is
- 3
The divisors add up to 2976; without 1550 itself that is 1426, so 1550 is deficient (1426 is less than 1550). Euler's totient φ(1550) = 600 numbers up to 1550 share no factor with it.
- 4
The digits of 1550 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1550 = 2 \times 5^{2} \times 31 \]1550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2976 |
| Euler totient φ(n) | 600 |
| Square | 2402500 |
| Cube | 3723875000 |
| Square root | 39.370039 (= 5√62) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 1.55 × |
1550 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and fifty |
| Roman numerals | MDL |
| Binary (base 2) | 11000001110 |
| Octal (base 8) | 3016 |
| Hexadecimal (base 16) | 60E |
| Base 3 | 2010102 |
| As time | 1550 seconds = 25 min 50 s |
Is 1550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1550 ÷ 2 = 775) | 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 (1550 ÷ 5 = 310) | 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 3) | 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 6) | 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 (1550 ÷ 10 = 155) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1550 a prime number?
No. 1550 = 2 × × 31, so it is divisible by 2.
What are the factors of 1550?
1, 2, 5, 10, 25, 31, 50, 62, 155, 310, 775, 1550.
What is 1550 in binary?
11000001110 (hexadecimal 60E, octal 3016).
What is the square root of 1550?
About 39.3700, exactly 5√62.
What is 1550 in Roman numerals?
MDL.
Is 1550 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1550?
It is a composite number with 12 divisors.