The number 68933
68933 is a composite number with 4 divisors. Its prime factorisation is 29 × 2377. Divisors (4): 1, 29, 2377, 68933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68933: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 2377, the product of two primes.
- 2
68933 is composite. Its prime factorisation is
- 3
The divisors add up to 71340; without 68933 itself that is 2407, so 68933 is deficient (2407 is less than 68933). Euler's totient φ(68933) = 66528 numbers up to 68933 share no factor with it.
- 4
The digits of 68933 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68933 = 29 \times 2377 \]
68933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71340 |
| Euler totient φ(n) | 66528 |
| Square | 4751758489 |
| Cube | 327552967922237 |
| Square root | 262.550947 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.8933 × |
68933 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and thirty-three |
| Binary (base 2) | 10000110101000101 |
| Octal (base 8) | 206505 |
| Hexadecimal (base 16) | 10D45 |
| Base 3 | 10111120002 |
| As time | 68933 seconds = 19 h 8 min 53 s |
Is 68933 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 | No (remainder 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68933 a prime number?
No. 68933 = 29 × 2377, so it is divisible by 29.
What are the factors of 68933?
1, 29, 2377, 68933.
What is 68933 in binary?
10000110101000101 (hexadecimal 10D45, octal 206505).
What is the square root of 68933?
About 262.5509.
Is 68933 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 68933?
68933 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 2377, the product of two primes.