The number 68902
68902 is a composite number with 8 divisors. Its prime factorisation is 2 × 47 × 733. Divisors (8): 1, 2, 47, 94, 733, 1466, 34451, 68902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68902 is composite. Its prime factorisation is
- 3
The divisors add up to 105696; without 68902 itself that is 36794, so 68902 is deficient (36794 is less than 68902). Euler's totient φ(68902) = 33672 numbers up to 68902 share no factor with it.
- 4
The digits of 68902 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68902 = 2 \times 47 \times 733 \]
68902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 105696 |
| Euler totient φ(n) | 33672 |
| Square | 4747485604 |
| Cube | 327111253086808 |
| Square root | 262.491905 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8902 × |
68902 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and two |
| Binary (base 2) | 10000110100100110 |
| Octal (base 8) | 206446 |
| Hexadecimal (base 16) | 10D26 |
| Base 3 | 10111111221 |
| As time | 68902 seconds = 19 h 8 min 22 s |
Is 68902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68902 ÷ 2 = 34451) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68902 a prime number?
No. 68902 = 2 × 47 × 733, so it is divisible by 2.
What are the factors of 68902?
1, 2, 47, 94, 733, 1466, 34451, 68902.
What is 68902 in binary?
10000110100100110 (hexadecimal 10D26, octal 206446).
What is the square root of 68902?
About 262.4919.
Is 68902 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 68902?
It is a composite number with 8 divisors.