The number 64550
64550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1291. Divisors (12): 1, 2, 5, 10, 25, 50, 1291, 2582, 6455, 12910, 32275, 64550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64550 is composite. Its prime factorisation is
- 3
The divisors add up to 120156; without 64550 itself that is 55606, so 64550 is deficient (55606 is less than 64550). Euler's totient φ(64550) = 25800 numbers up to 64550 share no factor with it.
- 4
The digits of 64550 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64550 = 2 \times 5^{2} \times 1291 \]64550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 120156 |
| Euler totient φ(n) | 25800 |
| Square | 4166702500 |
| Cube | 268960646375000 |
| Square root | 254.066920 (= 5√2582) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 192 |
| Scientific notation | 6.455 × |
64550 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand five hundred and fifty |
| Binary (base 2) | 1111110000100110 |
| Octal (base 8) | 176046 |
| Hexadecimal (base 16) | FC26 |
| Base 3 | 10021112202 |
| As time | 64550 seconds = 17 h 55 min 50 s |
Is 64550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64550 ÷ 2 = 32275) | 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 (64550 ÷ 5 = 12910) | 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 (64550 ÷ 10 = 6455) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 64550 a prime number?
No. 64550 = 2 × × 1291, so it is divisible by 2.
What are the factors of 64550?
1, 2, 5, 10, 25, 50, 1291, 2582, 6455, 12910, 32275, 64550.
What is 64550 in binary?
1111110000100110 (hexadecimal FC26, octal 176046).
What is the square root of 64550?
About 254.0669, exactly 5√2582.
Is 64550 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 64550?
It is a composite number with 12 divisors.