The number 68502
68502 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 233. Divisors (24): 1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 233, 294, 466, 699, 1398 … 68502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68502: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
68502 is composite. Its prime factorisation is
- 3
The divisors add up to 160056; without 68502 itself that is 91554, so 68502 is abundant (91554 is more than 68502). Euler's totient φ(68502) = 19488 numbers up to 68502 share no factor with it.
- 4
The digits of 68502 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68502 = 2 \times 3 \times 7^{2} \times 233 \]68502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 160056 |
| Euler totient φ(n) | 19488 |
| Square | 4692524004 |
| Cube | 321447279322008 |
| Square root | 261.728867 (= 7√1398) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.8502 × |
68502 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand five hundred and two |
| Binary (base 2) | 10000101110010110 |
| Octal (base 8) | 205626 |
| Hexadecimal (base 16) | 10B96 |
| Base 3 | 10110222010 |
| As time | 68502 seconds = 19 h 1 min 42 s |
Is 68502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68502 ÷ 2 = 34251) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68502 ÷ 3 = 22834) | 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 | Yes (68502 ÷ 6 = 11417) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (68502 ÷ 7 = 9786) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68502 a prime number?
No. 68502 = 2 × 3 × × 233, so it is divisible by 2.
What are the factors of 68502?
1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 233, 294, 466, 699, 1398, 1631, 3262, 4893, 9786, 11417, 22834, 34251, 68502.
What is 68502 in binary?
10000101110010110 (hexadecimal 10B96, octal 205626).
What is the square root of 68502?
About 261.7289, exactly 7√1398.
Is 68502 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 68502?
68502 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.