The number 6550
6550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 131. Divisors (12): 1, 2, 5, 10, 25, 50, 131, 262, 655, 1310, 3275, 6550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6550: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
6550 is composite. Its prime factorisation is
- 3
The divisors add up to 12276; without 6550 itself that is 5726, so 6550 is deficient (5726 is less than 6550). Euler's totient φ(6550) = 2600 numbers up to 6550 share no factor with it.
- 4
The digits of 6550 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6550 = 2 \times 5^{2} \times 131 \]6550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 12276 |
| Euler totient φ(n) | 2600 |
| Square | 42902500 |
| Cube | 281011375000 |
| Square root | 80.932070 (= 5√262) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 137 |
| Scientific notation | 6.55 × |
6550 in other forms
| Form | Value |
|---|---|
| In words | six thousand five hundred and fifty |
| Binary (base 2) | 1100110010110 |
| Octal (base 8) | 14626 |
| Hexadecimal (base 16) | 1996 |
| Base 3 | 22222121 |
| As time | 6550 seconds = 1 h 49 min 10 s |
Is 6550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6550 ÷ 2 = 3275) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (6550 ÷ 5 = 1310) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (6550 ÷ 10 = 655) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6550 a prime number?
No. 6550 = 2 × × 131, so it is divisible by 2.
What are the factors of 6550?
1, 2, 5, 10, 25, 50, 131, 262, 655, 1310, 3275, 6550.
What is 6550 in binary?
1100110010110 (hexadecimal 1996, octal 14626).
What is the square root of 6550?
About 80.9321, exactly 5√262.
Is 6550 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 6550?
6550 is a happy number: repeatedly adding the squares of its digits reaches 1.