The number 69002
69002 is a composite number with 4 divisors. Its prime factorisation is 2 × 34501. Divisors (4): 1, 2, 34501, 69002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69002: a semiprime: 2 × 34501, the product of two primes.
- 2
69002 is composite. Its prime factorisation is
- 3
The divisors add up to 103506; without 69002 itself that is 34504, so 69002 is deficient (34504 is less than 69002). Euler's totient φ(69002) = 34500 numbers up to 69002 share no factor with it.
- 4
The digits of 69002 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69002 = 2 \times 34501 \]
69002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 103506 |
| Euler totient φ(n) | 34500 |
| Square | 4761276004 |
| Cube | 328537566828008 |
| Square root | 262.682318 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9002 × |
69002 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and two |
| Binary (base 2) | 10000110110001010 |
| Octal (base 8) | 206612 |
| Hexadecimal (base 16) | 10D8A |
| Base 3 | 10111122122 |
| As time | 69002 seconds = 19 h 10 min 2 s |
Is 69002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69002 ÷ 2 = 34501) | 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 | No (remainder 2) | 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 3) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 69002 a prime number?
No. 69002 = 2 × 34501, so it is divisible by 2.
What are the factors of 69002?
1, 2, 34501, 69002.
What is 69002 in binary?
10000110110001010 (hexadecimal 10D8A, octal 206612).
What is the square root of 69002?
About 262.6823.
Is 69002 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 69002?
69002 is a semiprime: 2 × 34501, the product of two primes.