The number 68968
68968 is a composite number with 16 divisors. Its prime factorisation is × 37 × 233. Divisors (16): 1, 2, 4, 8, 37, 74, 148, 233, 296, 466, 932, 1864, 8621, 17242, 34484, 68968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68968: a Harshad number: divisible by its digit sum 37.
- 2
68968 is composite. Its prime factorisation is
- 3
The divisors add up to 133380; without 68968 itself that is 64412, so 68968 is deficient (64412 is less than 68968). Euler's totient φ(68968) = 33408 numbers up to 68968 share no factor with it.
- 4
The digits of 68968 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68968 = 2^{3} \times 37 \times 233 \]68968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 133380 |
| Euler totient φ(n) | 33408 |
| Square | 4756585024 |
| Cube | 328052155935232 |
| Square root | 262.617593 (= 2√17242) |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.8968 × |
68968 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and sixty-eight |
| Binary (base 2) | 10000110101101000 |
| Octal (base 8) | 206550 |
| Hexadecimal (base 16) | 10D68 |
| Base 3 | 10111121101 |
| As time | 68968 seconds = 19 h 9 min 28 s |
Is 68968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68968 ÷ 2 = 34484) | 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 (68968 ÷ 4 = 17242) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 | Yes (68968 ÷ 8 = 8621) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68968 a prime number?
No. 68968 = × 37 × 233, so it is divisible by 2.
What are the factors of 68968?
1, 2, 4, 8, 37, 74, 148, 233, 296, 466, 932, 1864, 8621, 17242, 34484, 68968.
What is 68968 in binary?
10000110101101000 (hexadecimal 10D68, octal 206550).
What is the square root of 68968?
About 262.6176, exactly 2√17242.
Is 68968 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 68968?
68968 is a Harshad number: divisible by its digit sum 37.