The number 68061
68061 is a composite number with 12 divisors. Its prime factorisation is 3 × × 463. Divisors (12): 1, 3, 7, 21, 49, 147, 463, 1389, 3241, 9723, 22687, 68061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68061: a Harshad number: divisible by its digit sum 21.
- 2
68061 is composite. Its prime factorisation is
- 3
The divisors add up to 105792; without 68061 itself that is 37731, so 68061 is deficient (37731 is less than 68061). Euler's totient φ(68061) = 38808 numbers up to 68061 share no factor with it.
- 4
The digits of 68061 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
\[ 68061 = 3 \times 7^{2} \times 463 \]68061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105792 |
| Euler totient φ(n) | 38808 |
| Square | 4632299721 |
| Cube | 315278951310981 |
| Square root | 260.885032 (= 7√1389) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8061 × |
68061 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and sixty-one |
| Binary (base 2) | 10000100111011101 |
| Octal (base 8) | 204735 |
| Hexadecimal (base 16) | 109DD |
| Base 3 | 10110100210 |
| As time | 68061 seconds = 18 h 54 min 21 s |
Is 68061 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68061 ÷ 3 = 22687) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (68061 ÷ 7 = 9723) | 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 5) | 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 1) | 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 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68061 a prime number?
No. 68061 = 3 × × 463, so it is divisible by 3.
What are the factors of 68061?
1, 3, 7, 21, 49, 147, 463, 1389, 3241, 9723, 22687, 68061.
What is 68061 in binary?
10000100111011101 (hexadecimal 109DD, octal 204735).
What is the square root of 68061?
About 260.8850, exactly 7√1389.
Is 68061 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 68061?
68061 is a Harshad number: divisible by its digit sum 21.