The number 68010
68010 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2267. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2267, 4534, 6801, 11335, 13602, 22670, 34005, 68010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68010: a Harshad number: divisible by its digit sum 15.
- 2
68010 is composite. Its prime factorisation is
- 3
The divisors add up to 163296; without 68010 itself that is 95286, so 68010 is abundant (95286 is more than 68010). Euler's totient φ(68010) = 18128 numbers up to 68010 share no factor with it.
- 4
The digits of 68010 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68010 = 2 \times 3 \times 5 \times 2267 \]
68010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 163296 |
| Euler totient φ(n) | 18128 |
| Square | 4625360100 |
| Cube | 314570740401000 |
| Square root | 260.787270 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.801 × |
68010 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and ten |
| Binary (base 2) | 10000100110101010 |
| Octal (base 8) | 204652 |
| Hexadecimal (base 16) | 109AA |
| Base 3 | 10110021220 |
| As time | 68010 seconds = 18 h 53 min 30 s |
Is 68010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68010 ÷ 2 = 34005) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68010 ÷ 3 = 22670) | 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 | Yes (68010 ÷ 5 = 13602) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (68010 ÷ 6 = 11335) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (68010 ÷ 10 = 6801) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 68010 a prime number?
No. 68010 = 2 × 3 × 5 × 2267, so it is divisible by 2.
What are the factors of 68010?
1, 2, 3, 5, 6, 10, 15, 30, 2267, 4534, 6801, 11335, 13602, 22670, 34005, 68010.
What is 68010 in binary?
10000100110101010 (hexadecimal 109AA, octal 204652).
What is the square root of 68010?
About 260.7873.
Is 68010 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 68010?
68010 is a Harshad number: divisible by its digit sum 15.