The number 68058
68058 is a composite number with 24 divisors. Its prime factorisation is 2 × × 19 × 199. Divisors (24): 1, 2, 3, 6, 9, 18, 19, 38, 57, 114, 171, 199, 342, 398, 597, 1194 … 68058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68058 is composite. Its prime factorisation is
- 3
The divisors add up to 156000; without 68058 itself that is 87942, so 68058 is abundant (87942 is more than 68058). Euler's totient φ(68058) = 21384 numbers up to 68058 share no factor with it.
- 4
The digits of 68058 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68058 = 2 \times 3^{2} \times 19 \times 199 \]68058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 156000 |
| Euler totient φ(n) | 21384 |
| Square | 4631891364 |
| Cube | 315237262451112 |
| Square root | 260.879282 (= 3√7562) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8058 × |
68058 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and fifty-eight |
| Binary (base 2) | 10000100111011010 |
| Octal (base 8) | 204732 |
| Hexadecimal (base 16) | 109DA |
| Base 3 | 10110100200 |
| As time | 68058 seconds = 18 h 54 min 18 s |
Is 68058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68058 ÷ 2 = 34029) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68058 ÷ 3 = 22686) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (68058 ÷ 6 = 11343) | 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (68058 ÷ 9 = 7562) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68058 a prime number?
No. 68058 = 2 × × 19 × 199, so it is divisible by 2.
What are the factors of 68058?
1, 2, 3, 6, 9, 18, 19, 38, 57, 114, 171, 199, 342, 398, 597, 1194, 1791, 3582, 3781, 7562, 11343, 22686, 34029, 68058.
What is 68058 in binary?
10000100111011010 (hexadecimal 109DA, octal 204732).
What is the square root of 68058?
About 260.8793, exactly 3√7562.
Is 68058 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 68058?
It is a composite number with 24 divisors.