The number 63560
63560 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7 × 227. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 227 … 63560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63560: a Harshad number: divisible by its digit sum 20.
- 2
63560 is composite. Its prime factorisation is
- 3
The divisors add up to 164160; without 63560 itself that is 100600, so 63560 is abundant (100600 is more than 63560). Euler's totient φ(63560) = 21696 numbers up to 63560 share no factor with it.
- 4
The digits of 63560 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63560 = 2^{3} \times 5 \times 7 \times 227 \]63560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 164160 |
| Euler totient φ(n) | 21696 |
| Square | 4039873600 |
| Cube | 256774366016000 |
| Square root | 252.111087 (= 2√15890) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.356 × |
63560 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand five hundred and sixty |
| Binary (base 2) | 1111100001001000 |
| Octal (base 8) | 174110 |
| Hexadecimal (base 16) | F848 |
| Base 3 | 10020012002 |
| As time | 63560 seconds = 17 h 39 min 20 s |
Is 63560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63560 ÷ 2 = 31780) | 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 | Yes (63560 ÷ 4 = 15890) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63560 ÷ 5 = 12712) | 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 | Yes (63560 ÷ 7 = 9080) | 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 | Yes (63560 ÷ 8 = 7945) | 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 (63560 ÷ 10 = 6356) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63560 a prime number?
No. 63560 = × 5 × 7 × 227, so it is divisible by 2.
What are the factors of 63560?
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 227, 280, 454, 908, 1135, 1589, 1816, 2270, 3178, 4540, 6356, 7945, 9080, 12712, 15890, 31780, 63560.
What is 63560 in binary?
1111100001001000 (hexadecimal F848, octal 174110).
What is the square root of 63560?
About 252.1111, exactly 2√15890.
Is 63560 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 63560?
63560 is a Harshad number: divisible by its digit sum 20.