The number 63964
63964 is a composite number with 6 divisors. Its prime factorisation is × 15991. Divisors (6): 1, 2, 4, 15991, 31982, 63964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63964 is composite. Its prime factorisation is
- 3
The divisors add up to 111944; without 63964 itself that is 47980, so 63964 is deficient (47980 is less than 63964). Euler's totient φ(63964) = 31980 numbers up to 63964 share no factor with it.
- 4
The digits of 63964 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63964 = 2^{2} \times 15991 \]63964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 111944 |
| Euler totient φ(n) | 31980 |
| Square | 4091393296 |
| Cube | 261701880785344 |
| Square root | 252.911052 (= 2√15991) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3964 × |
63964 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and sixty-four |
| Binary (base 2) | 1111100111011100 |
| Octal (base 8) | 174734 |
| Hexadecimal (base 16) | F9DC |
| Base 3 | 10020202001 |
| As time | 63964 seconds = 17 h 46 min 4 s |
Is 63964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63964 ÷ 2 = 31982) | 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 (63964 ÷ 4 = 15991) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 5) | 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 4) | 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 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 63964 a prime number?
No. 63964 = × 15991, so it is divisible by 2.
What are the factors of 63964?
1, 2, 4, 15991, 31982, 63964.
What is 63964 in binary?
1111100111011100 (hexadecimal F9DC, octal 174734).
What is the square root of 63964?
About 252.9111, exactly 2√15991.
Is 63964 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 63964?
It is a composite number with 6 divisors.