The number 68052
68052 is a composite number with 24 divisors. Its prime factorisation is × 3 × 53 × 107. Divisors (24): 1, 2, 3, 4, 6, 12, 53, 106, 107, 159, 212, 214, 318, 321, 428, 636 … 68052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
68052 is composite. Its prime factorisation is
- 3
The divisors add up to 163296; without 68052 itself that is 95244, so 68052 is abundant (95244 is more than 68052). Euler's totient φ(68052) = 22048 numbers up to 68052 share no factor with it.
- 4
The digits of 68052 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68052 = 2^{2} \times 3 \times 53 \times 107 \]68052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 163296 |
| Euler totient φ(n) | 22048 |
| Square | 4631074704 |
| Cube | 315153895756608 |
| Square root | 260.867783 (= 2√17013) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8052 × |
68052 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and fifty-two |
| Binary (base 2) | 10000100111010100 |
| Octal (base 8) | 204724 |
| Hexadecimal (base 16) | 109D4 |
| Base 3 | 10110100110 |
| As time | 68052 seconds = 18 h 54 min 12 s |
Is 68052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68052 ÷ 2 = 34026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68052 ÷ 3 = 22684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (68052 ÷ 4 = 17013) | 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 (68052 ÷ 6 = 11342) | 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 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (68052 ÷ 12 = 5671) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68052 a prime number?
No. 68052 = × 3 × 53 × 107, so it is divisible by 2.
What are the factors of 68052?
1, 2, 3, 4, 6, 12, 53, 106, 107, 159, 212, 214, 318, 321, 428, 636, 642, 1284, 5671, 11342, 17013, 22684, 34026, 68052.
What is 68052 in binary?
10000100111010100 (hexadecimal 109D4, octal 204724).
What is the square root of 68052?
About 260.8678, exactly 2√17013.
Is 68052 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 68052?
68052 is a happy number: repeatedly adding the squares of its digits reaches 1.