The number 67952
67952 is a composite number with 20 divisors. Its prime factorisation is × 31 × 137. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 124, 137, 248, 274, 496, 548, 1096, 2192, 4247 … 67952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
67952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
67952 is composite. Its prime factorisation is
- 3
The divisors add up to 136896; without 67952 itself that is 68944, so 67952 is abundant (68944 is more than 67952). Euler's totient φ(67952) = 32640 numbers up to 67952 share no factor with it.
- 4
The digits of 67952 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67952 = 2^{4} \times 31 \times 137 \]67952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 136896 |
| Euler totient φ(n) | 32640 |
| Square | 4617474304 |
| Cube | 313766613905408 |
| Square root | 260.676044 (= 4√4247) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 37 |
| Scientific notation | 6.7952 × |
67952 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and fifty-two |
| Binary (base 2) | 10000100101110000 |
| Octal (base 8) | 204560 |
| Hexadecimal (base 16) | 10970 |
| Base 3 | 10110012202 |
| As time | 67952 seconds = 18 h 52 min 32 s |
Is 67952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (67952 ÷ 2 = 33976) | 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 (67952 ÷ 4 = 16988) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (67952 ÷ 8 = 8494) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 5) | 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 67952 a prime number?
No. 67952 = × 31 × 137, so it is divisible by 2.
What are the factors of 67952?
1, 2, 4, 8, 16, 31, 62, 124, 137, 248, 274, 496, 548, 1096, 2192, 4247, 8494, 16988, 33976, 67952.
What is 67952 in binary?
10000100101110000 (hexadecimal 10970, octal 204560).
What is the square root of 67952?
About 260.6760, exactly 4√4247.
Is 67952 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 67952?
It is a composite number with 20 divisors.