The number 67946
67946 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 641. Divisors (8): 1, 2, 53, 106, 641, 1282, 33973, 67946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
67946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
67946 is composite. Its prime factorisation is
- 3
The divisors add up to 104004; without 67946 itself that is 36058, so 67946 is deficient (36058 is less than 67946). Euler's totient φ(67946) = 33280 numbers up to 67946 share no factor with it.
- 4
The digits of 67946 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67946 = 2 \times 53 \times 641 \]
67946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104004 |
| Euler totient φ(n) | 33280 |
| Square | 4616658916 |
| Cube | 313683506706536 |
| Square root | 260.664535 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 37 |
| Scientific notation | 6.7946 × |
67946 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and forty-six |
| Binary (base 2) | 10000100101101010 |
| Octal (base 8) | 204552 |
| Hexadecimal (base 16) | 1096A |
| Base 3 | 10110012112 |
| As time | 67946 seconds = 18 h 52 min 26 s |
Is 67946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (67946 ÷ 2 = 33973) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 4) | 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 2) | 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 67946 a prime number?
No. 67946 = 2 × 53 × 641, so it is divisible by 2.
What are the factors of 67946?
1, 2, 53, 106, 641, 1282, 33973, 67946.
What is 67946 in binary?
10000100101101010 (hexadecimal 1096A, octal 204552).
What is the square root of 67946?
About 260.6645.
Is 67946 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 67946?
It is a composite number with 8 divisors.