The number 63520
63520 is a composite number with 24 divisors. Its prime factorisation is × 5 × 397. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 397, 794, 1588, 1985 … 63520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63520: a Harshad number: divisible by its digit sum 16.
- 2
63520 is composite. Its prime factorisation is
- 3
The divisors add up to 150444; without 63520 itself that is 86924, so 63520 is abundant (86924 is more than 63520). Euler's totient φ(63520) = 25344 numbers up to 63520 share no factor with it.
- 4
The digits of 63520 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63520 = 2^{5} \times 5 \times 397 \]63520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 150444 |
| Euler totient φ(n) | 25344 |
| Square | 4034790400 |
| Cube | 256289886208000 |
| Square root | 252.031744 (= 4√3970) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.352 × |
63520 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand five hundred and twenty |
| Binary (base 2) | 1111100000100000 |
| Octal (base 8) | 174040 |
| Hexadecimal (base 16) | F820 |
| Base 3 | 10020010121 |
| As time | 63520 seconds = 17 h 38 min 40 s |
Is 63520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63520 ÷ 2 = 31760) | 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 | Yes (63520 ÷ 4 = 15880) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63520 ÷ 5 = 12704) | 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 2) | 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 (63520 ÷ 8 = 7940) | 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 (63520 ÷ 10 = 6352) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63520 a prime number?
No. 63520 = × 5 × 397, so it is divisible by 2.
What are the factors of 63520?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 397, 794, 1588, 1985, 3176, 3970, 6352, 7940, 12704, 15880, 31760, 63520.
What is 63520 in binary?
1111100000100000 (hexadecimal F820, octal 174040).
What is the square root of 63520?
About 252.0317, exactly 4√3970.
Is 63520 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 63520?
63520 is a Harshad number: divisible by its digit sum 16.