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