The number 63550
63550 is a composite number with 24 divisors. Its prime factorisation is 2 × × 31 × 41. Divisors (24): 1, 2, 5, 10, 25, 31, 41, 50, 62, 82, 155, 205, 310, 410, 775, 1025 … 63550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63550 is composite. Its prime factorisation is
- 3
The divisors add up to 124992; without 63550 itself that is 61442, so 63550 is deficient (61442 is less than 63550). Euler's totient φ(63550) = 24000 numbers up to 63550 share no factor with it.
- 4
The digits of 63550 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63550 = 2 \times 5^{2} \times 31 \times 41 \]63550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 124992 |
| Euler totient φ(n) | 24000 |
| Square | 4038602500 |
| Cube | 256653188875000 |
| Square root | 252.091253 (= 5√2542) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 6.355 × |
63550 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand five hundred and fifty |
| Binary (base 2) | 1111100000111110 |
| Octal (base 8) | 174076 |
| Hexadecimal (base 16) | F83E |
| Base 3 | 10020011201 |
| As time | 63550 seconds = 17 h 39 min 10 s |
Is 63550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63550 ÷ 2 = 31775) | 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 (63550 ÷ 5 = 12710) | 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 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63550 ÷ 10 = 6355) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 63550 a prime number?
No. 63550 = 2 × × 31 × 41, so it is divisible by 2.
What are the factors of 63550?
1, 2, 5, 10, 25, 31, 41, 50, 62, 82, 155, 205, 310, 410, 775, 1025, 1271, 1550, 2050, 2542, 6355, 12710, 31775, 63550.
What is 63550 in binary?
1111100000111110 (hexadecimal F83E, octal 174076).
What is the square root of 63550?
About 252.0913, exactly 5√2542.
Is 63550 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 63550?
It is a composite number with 24 divisors.