The number 68930
68930 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 61 × 113. Divisors (16): 1, 2, 5, 10, 61, 113, 122, 226, 305, 565, 610, 1130, 6893, 13786, 34465, 68930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68930: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
68930 is composite. Its prime factorisation is
- 3
The divisors add up to 127224; without 68930 itself that is 58294, so 68930 is deficient (58294 is less than 68930). Euler's totient φ(68930) = 26880 numbers up to 68930 share no factor with it.
- 4
The digits of 68930 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68930 = 2 \times 5 \times 61 \times 113 \]
68930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 127224 |
| Euler totient φ(n) | 26880 |
| Square | 4751344900 |
| Cube | 327510203957000 |
| Square root | 262.545234 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.893 × |
68930 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and thirty |
| Binary (base 2) | 10000110101000010 |
| Octal (base 8) | 206502 |
| Hexadecimal (base 16) | 10D42 |
| Base 3 | 10111112222 |
| As time | 68930 seconds = 19 h 8 min 50 s |
Is 68930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68930 ÷ 2 = 34465) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (68930 ÷ 5 = 13786) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | 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 | Yes (68930 ÷ 10 = 6893) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68930 a prime number?
No. 68930 = 2 × 5 × 61 × 113, so it is divisible by 2.
What are the factors of 68930?
1, 2, 5, 10, 61, 113, 122, 226, 305, 565, 610, 1130, 6893, 13786, 34465, 68930.
What is 68930 in binary?
10000110101000010 (hexadecimal 10D42, octal 206502).
What is the square root of 68930?
About 262.5452.
Is 68930 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 68930?
68930 is a happy number: repeatedly adding the squares of its digits reaches 1.