The number 68152
68152 is a composite number with 16 divisors. Its prime factorisation is × 7 × 1217. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 1217, 2434, 4868, 8519, 9736, 17038, 34076, 68152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
68152 is composite. Its prime factorisation is
- 3
The divisors add up to 146160; without 68152 itself that is 78008, so 68152 is abundant (78008 is more than 68152). Euler's totient φ(68152) = 29184 numbers up to 68152 share no factor with it.
- 4
The digits of 68152 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68152 = 2^{3} \times 7 \times 1217 \]68152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 146160 |
| Euler totient φ(n) | 29184 |
| Square | 4644695104 |
| Cube | 316545260727808 |
| Square root | 261.059380 (= 2√17038) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.8152 × |
68152 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand one hundred and fifty-two |
| Binary (base 2) | 10000101000111000 |
| Octal (base 8) | 205070 |
| Hexadecimal (base 16) | 10A38 |
| Base 3 | 10110111011 |
| As time | 68152 seconds = 18 h 55 min 52 s |
Is 68152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68152 ÷ 2 = 34076) | 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 (68152 ÷ 4 = 17038) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (68152 ÷ 7 = 9736) | 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 (68152 ÷ 8 = 8519) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | 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 68152 a prime number?
No. 68152 = × 7 × 1217, so it is divisible by 2.
What are the factors of 68152?
1, 2, 4, 7, 8, 14, 28, 56, 1217, 2434, 4868, 8519, 9736, 17038, 34076, 68152.
What is 68152 in binary?
10000101000111000 (hexadecimal 10A38, octal 205070).
What is the square root of 68152?
About 261.0594, exactly 2√17038.
Is 68152 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 68152?
68152 is a happy number: repeatedly adding the squares of its digits reaches 1.