The number 68952
68952 is a composite number with 48 divisors. Its prime factorisation is × 3 × × 17. Divisors (48): 1, 2, 3, 4, 6, 8, 12, 13, 17, 24, 26, 34, 39, 51, 52, 68 … 68952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68952 is composite. Its prime factorisation is
- 3
The divisors add up to 197640; without 68952 itself that is 128688, so 68952 is abundant (128688 is more than 68952). Euler's totient φ(68952) = 19968 numbers up to 68952 share no factor with it.
- 4
The digits of 68952 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68952 = 2^{3} \times 3 \times 13^{2} \times 17 \]68952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 197640 |
| Euler totient φ(n) | 19968 |
| Square | 4754378304 |
| Cube | 327823892817408 |
| Square root | 262.587128 (= 26√102) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.8952 × |
68952 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and fifty-two |
| Binary (base 2) | 10000110101011000 |
| Octal (base 8) | 206530 |
| Hexadecimal (base 16) | 10D58 |
| Base 3 | 10111120210 |
| As time | 68952 seconds = 19 h 9 min 12 s |
Is 68952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68952 ÷ 2 = 34476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68952 ÷ 3 = 22984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (68952 ÷ 4 = 17238) | 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 | Yes (68952 ÷ 6 = 11492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (68952 ÷ 8 = 8619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (68952 ÷ 12 = 5746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68952 a prime number?
No. 68952 = × 3 × × 17, so it is divisible by 2.
What are the factors of 68952?
1, 2, 3, 4, 6, 8, 12, 13, 17, 24, 26, 34, 39, 51, 52, 68, 78, 102, 104, 136, 156, 169, 204, 221, 312, 338, 408, 442, 507, 663, 676, 884, 1014, 1326, 1352, 1768, 2028, 2652, 2873, 4056, 5304, 5746, 8619, 11492, 17238, 22984, 34476, 68952.
What is 68952 in binary?
10000110101011000 (hexadecimal 10D58, octal 206530).
What is the square root of 68952?
About 262.5871, exactly 26√102.
Is 68952 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 68952?
It is a composite number with 48 divisors.