The number 63968
63968 is a composite number with 12 divisors. Its prime factorisation is × 1999. Divisors (12): 1, 2, 4, 8, 16, 32, 1999, 3998, 7996, 15992, 31984, 63968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63968: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 32.
- 2
63968 is composite. Its prime factorisation is
- 3
The divisors add up to 126000; without 63968 itself that is 62032, so 63968 is deficient (62032 is less than 63968). Euler's totient φ(63968) = 31968 numbers up to 63968 share no factor with it.
- 4
The digits of 63968 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63968 = 2^{5} \times 1999 \]63968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 126000 |
| Euler totient φ(n) | 31968 |
| Square | 4091905024 |
| Cube | 261750980575232 |
| Square root | 252.918959 (= 4√3998) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3968 × |
63968 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and sixty-eight |
| Binary (base 2) | 1111100111100000 |
| Octal (base 8) | 174740 |
| Hexadecimal (base 16) | F9E0 |
| Base 3 | 10020202012 |
| As time | 63968 seconds = 17 h 46 min 8 s |
Is 63968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63968 ÷ 2 = 31984) | 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 (63968 ÷ 4 = 15992) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 (63968 ÷ 8 = 7996) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63968 a prime number?
No. 63968 = × 1999, so it is divisible by 2.
What are the factors of 63968?
1, 2, 4, 8, 16, 32, 1999, 3998, 7996, 15992, 31984, 63968.
What is 63968 in binary?
1111100111100000 (hexadecimal F9E0, octal 174740).
What is the square root of 63968?
About 252.9190, exactly 4√3998.
Is 63968 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 63968?
63968 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 32.