The number 68931
68931 is a composite number with 20 divisors. Its prime factorisation is × 23 × 37. Divisors (20): 1, 3, 9, 23, 27, 37, 69, 81, 111, 207, 333, 621, 851, 999, 1863, 2553 … 68931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68931: a Harshad number: divisible by its digit sum 27.
- 2
68931 is composite. Its prime factorisation is
- 3
The divisors add up to 110352; without 68931 itself that is 41421, so 68931 is deficient (41421 is less than 68931). Euler's totient φ(68931) = 42768 numbers up to 68931 share no factor with it.
- 4
The digits of 68931 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
\[ 68931 = 3^{4} \times 23 \times 37 \]68931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 110352 |
| Euler totient φ(n) | 42768 |
| Square | 4751482761 |
| Cube | 327524458198491 |
| Square root | 262.547139 (= 9√851) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8931 × |
68931 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and thirty-one |
| Binary (base 2) | 10000110101000011 |
| Octal (base 8) | 206503 |
| Hexadecimal (base 16) | 10D43 |
| Base 3 | 10111120000 |
| As time | 68931 seconds = 19 h 8 min 51 s |
Is 68931 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 (68931 ÷ 3 = 22977) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (68931 ÷ 9 = 7659) | 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 5) | 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 68931 a prime number?
No. 68931 = × 23 × 37, so it is divisible by 3.
What are the factors of 68931?
1, 3, 9, 23, 27, 37, 69, 81, 111, 207, 333, 621, 851, 999, 1863, 2553, 2997, 7659, 22977, 68931.
What is 68931 in binary?
10000110101000011 (hexadecimal 10D43, octal 206503).
What is the square root of 68931?
About 262.5471, exactly 9√851.
Is 68931 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 68931?
68931 is a Harshad number: divisible by its digit sum 27.