The number 68946
68946 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 11491. Divisors (8): 1, 2, 3, 6, 11491, 22982, 34473, 68946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68946 is composite. Its prime factorisation is
- 3
The divisors add up to 137904; without 68946 itself that is 68958, so 68946 is abundant (68958 is more than 68946). Euler's totient φ(68946) = 22980 numbers up to 68946 share no factor with it.
- 4
The digits of 68946 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68946 = 2 \times 3 \times 11491 \]
68946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 137904 |
| Euler totient φ(n) | 22980 |
| Square | 4753550916 |
| Cube | 327738321454536 |
| Square root | 262.575703 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.8946 × |
68946 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and forty-six |
| Binary (base 2) | 10000110101010010 |
| Octal (base 8) | 206522 |
| Hexadecimal (base 16) | 10D52 |
| Base 3 | 10111120120 |
| As time | 68946 seconds = 19 h 9 min 6 s |
Is 68946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68946 ÷ 2 = 34473) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68946 ÷ 3 = 22982) | 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 | Yes (68946 ÷ 6 = 11491) | 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68946 a prime number?
No. 68946 = 2 × 3 × 11491, so it is divisible by 2.
What are the factors of 68946?
1, 2, 3, 6, 11491, 22982, 34473, 68946.
What is 68946 in binary?
10000110101010010 (hexadecimal 10D52, octal 206522).
What is the square root of 68946?
About 262.5757.
Is 68946 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 68946?
It is a composite number with 8 divisors.