The number 68391
68391 is a composite number with 16 divisors. Its prime factorisation is × 17 × 149. Divisors (16): 1, 3, 9, 17, 27, 51, 149, 153, 447, 459, 1341, 2533, 4023, 7599, 22797, 68391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68391: a Harshad number: divisible by its digit sum 27.
- 2
68391 is composite. Its prime factorisation is
- 3
The divisors add up to 108000; without 68391 itself that is 39609, so 68391 is deficient (39609 is less than 68391). Euler's totient φ(68391) = 42624 numbers up to 68391 share no factor with it.
- 4
The digits of 68391 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68391 = 3^{3} \times 17 \times 149 \]68391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108000 |
| Euler totient φ(n) | 42624 |
| Square | 4677328881 |
| Cube | 319887199500471 |
| Square root | 261.516730 (= 3√7599) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.8391 × |
68391 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand three hundred and ninety-one |
| Binary (base 2) | 10000101100100111 |
| Octal (base 8) | 205447 |
| Hexadecimal (base 16) | 10B27 |
| Base 3 | 10110211000 |
| As time | 68391 seconds = 18 h 59 min 51 s |
Is 68391 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 (68391 ÷ 3 = 22797) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (68391 ÷ 9 = 7599) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68391 a prime number?
No. 68391 = × 17 × 149, so it is divisible by 3.
What are the factors of 68391?
1, 3, 9, 17, 27, 51, 149, 153, 447, 459, 1341, 2533, 4023, 7599, 22797, 68391.
What is 68391 in binary?
10000101100100111 (hexadecimal 10B27, octal 205447).
What is the square root of 68391?
About 261.5167, exactly 3√7599.
Is 68391 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 68391?
68391 is a Harshad number: divisible by its digit sum 27.