The number 63952
63952 is a composite number with 20 divisors. Its prime factorisation is × 7 × 571. Divisors (20): 1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 571, 1142, 2284, 3997, 4568, 7994 … 63952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63952 is composite. Its prime factorisation is
- 3
The divisors add up to 141856; without 63952 itself that is 77904, so 63952 is abundant (77904 is more than 63952). Euler's totient φ(63952) = 27360 numbers up to 63952 share no factor with it.
- 4
The digits of 63952 add up to 25, 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
\[ 63952 = 2^{4} \times 7 \times 571 \]63952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 141856 |
| Euler totient φ(n) | 27360 |
| Square | 4089858304 |
| Cube | 261554618257408 |
| Square root | 252.887327 (= 4√3997) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3952 × |
63952 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and fifty-two |
| Binary (base 2) | 1111100111010000 |
| Octal (base 8) | 174720 |
| Hexadecimal (base 16) | F9D0 |
| Base 3 | 10020201121 |
| As time | 63952 seconds = 17 h 45 min 52 s |
Is 63952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63952 ÷ 2 = 31976) | 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 (63952 ÷ 4 = 15988) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (63952 ÷ 7 = 9136) | 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 (63952 ÷ 8 = 7994) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 63952 a prime number?
No. 63952 = × 7 × 571, so it is divisible by 2.
What are the factors of 63952?
1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 571, 1142, 2284, 3997, 4568, 7994, 9136, 15988, 31976, 63952.
What is 63952 in binary?
1111100111010000 (hexadecimal F9D0, octal 174720).
What is the square root of 63952?
About 252.8873, exactly 4√3997.
Is 63952 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 63952?
It is a composite number with 20 divisors.