The number 68948
68948 is a composite number with 12 divisors. Its prime factorisation is × 11 × 1567. Divisors (12): 1, 2, 4, 11, 22, 44, 1567, 3134, 6268, 17237, 34474, 68948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68948 is composite. Its prime factorisation is
- 3
The divisors add up to 131712; without 68948 itself that is 62764, so 68948 is deficient (62764 is less than 68948). Euler's totient φ(68948) = 31320 numbers up to 68948 share no factor with it.
- 4
The digits of 68948 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68948 = 2^{2} \times 11 \times 1567 \]68948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 131712 |
| Euler totient φ(n) | 31320 |
| Square | 4753826704 |
| Cube | 327766843587392 |
| Square root | 262.579512 (= 2√17237) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 37 |
| Scientific notation | 6.8948 × |
68948 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and forty-eight |
| Binary (base 2) | 10000110101010100 |
| Octal (base 8) | 206524 |
| Hexadecimal (base 16) | 10D54 |
| Base 3 | 10111120122 |
| As time | 68948 seconds = 19 h 9 min 8 s |
Is 68948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68948 ÷ 2 = 34474) | 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 (68948 ÷ 4 = 17237) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 | Yes (68948 ÷ 11 = 6268) | 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 68948 a prime number?
No. 68948 = × 11 × 1567, so it is divisible by 2.
What are the factors of 68948?
1, 2, 4, 11, 22, 44, 1567, 3134, 6268, 17237, 34474, 68948.
What is 68948 in binary?
10000110101010100 (hexadecimal 10D54, octal 206524).
What is the square root of 68948?
About 262.5795, exactly 2√17237.
Is 68948 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 68948?
It is a composite number with 12 divisors.