The number 67964
67964 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1307. Divisors (12): 1, 2, 4, 13, 26, 52, 1307, 2614, 5228, 16991, 33982, 67964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
67964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
67964 is composite. Its prime factorisation is
- 3
The divisors add up to 128184; without 67964 itself that is 60220, so 67964 is deficient (60220 is less than 67964). Euler's totient φ(67964) = 31344 numbers up to 67964 share no factor with it.
- 4
The digits of 67964 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67964 = 2^{2} \times 13 \times 1307 \]67964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 128184 |
| Euler totient φ(n) | 31344 |
| Square | 4619105296 |
| Cube | 313932872337344 |
| Square root | 260.699060 (= 2√16991) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.7964 × |
67964 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and sixty-four |
| Binary (base 2) | 10000100101111100 |
| Octal (base 8) | 204574 |
| Hexadecimal (base 16) | 1097C |
| Base 3 | 10110020012 |
| As time | 67964 seconds = 18 h 52 min 44 s |
Is 67964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (67964 ÷ 2 = 33982) | 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 (67964 ÷ 4 = 16991) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | 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 6) | 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 67964 a prime number?
No. 67964 = × 13 × 1307, so it is divisible by 2.
What are the factors of 67964?
1, 2, 4, 13, 26, 52, 1307, 2614, 5228, 16991, 33982, 67964.
What is 67964 in binary?
10000100101111100 (hexadecimal 1097C, octal 204574).
What is the square root of 67964?
About 260.6991, exactly 2√16991.
Is 67964 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 67964?
It is a composite number with 12 divisors.