The number 68093
68093 is a composite number with 4 divisors. Its prime factorisation is 149 × 457. Divisors (4): 1, 149, 457, 68093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68093: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 149 × 457, the product of two primes.
- 2
68093 is composite. Its prime factorisation is
- 3
The divisors add up to 68700; without 68093 itself that is 607, so 68093 is deficient (607 is less than 68093). Euler's totient φ(68093) = 67488 numbers up to 68093 share no factor with it.
- 4
The digits of 68093 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 218 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68093 = 149 \times 457 \]
68093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68700 |
| Euler totient φ(n) | 67488 |
| Square | 4636656649 |
| Cube | 315723861200357 |
| Square root | 260.946355 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 218 |
| Scientific notation | 6.8093 × |
68093 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and ninety-three |
| Binary (base 2) | 10000100111111101 |
| Octal (base 8) | 204775 |
| Hexadecimal (base 16) | 109FD |
| Base 3 | 10110101222 |
| As time | 68093 seconds = 18 h 54 min 53 s |
Is 68093 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 8) | 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 3) | 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 68093 a prime number?
No. 68093 = 149 × 457, so it is divisible by 149.
What are the factors of 68093?
1, 149, 457, 68093.
What is 68093 in binary?
10000100111111101 (hexadecimal 109FD, octal 204775).
What is the square root of 68093?
About 260.9464.
Is 68093 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 68093?
68093 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 149 × 457, the product of two primes.