The number 68364
68364 is a composite number with 30 divisors. Its prime factorisation is × × 211. Divisors (30): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 211, 324 … 68364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68364: a Harshad number: divisible by its digit sum 27.
- 2
68364 is composite. Its prime factorisation is
- 3
The divisors add up to 179564; without 68364 itself that is 111200, so 68364 is abundant (111200 is more than 68364). Euler's totient φ(68364) = 22680 numbers up to 68364 share no factor with it.
- 4
The digits of 68364 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68364 = 2^{2} \times 3^{4} \times 211 \]68364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 179564 |
| Euler totient φ(n) | 22680 |
| Square | 4673636496 |
| Cube | 319508485412544 |
| Square root | 261.465103 (= 18√211) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.8364 × |
68364 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand three hundred and sixty-four |
| Binary (base 2) | 10000101100001100 |
| Octal (base 8) | 205414 |
| Hexadecimal (base 16) | 10B0C |
| Base 3 | 10110210000 |
| As time | 68364 seconds = 18 h 59 min 24 s |
Is 68364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68364 ÷ 2 = 34182) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68364 ÷ 3 = 22788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (68364 ÷ 4 = 17091) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (68364 ÷ 6 = 11394) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (68364 ÷ 9 = 7596) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (68364 ÷ 12 = 5697) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68364 a prime number?
No. 68364 = × × 211, so it is divisible by 2.
What are the factors of 68364?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 211, 324, 422, 633, 844, 1266, 1899, 2532, 3798, 5697, 7596, 11394, 17091, 22788, 34182, 68364.
What is 68364 in binary?
10000101100001100 (hexadecimal 10B0C, octal 205414).
What is the square root of 68364?
About 261.4651, exactly 18√211.
Is 68364 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 68364?
68364 is a Harshad number: divisible by its digit sum 27.