The number 69010
69010 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 67 × 103. Divisors (16): 1, 2, 5, 10, 67, 103, 134, 206, 335, 515, 670, 1030, 6901, 13802, 34505, 69010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69010 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69010 is composite. Its prime factorisation is
- 3
The divisors add up to 127296; without 69010 itself that is 58286, so 69010 is deficient (58286 is less than 69010). Euler's totient φ(69010) = 26928 numbers up to 69010 share no factor with it.
- 4
The digits of 69010 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69010 = 2 \times 5 \times 67 \times 103 \]
69010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 127296 |
| Euler totient φ(n) | 26928 |
| Square | 4762380100 |
| Cube | 328651850701000 |
| Square root | 262.697545 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.901 × |
69010 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and ten |
| Binary (base 2) | 10000110110010010 |
| Octal (base 8) | 206622 |
| Hexadecimal (base 16) | 10D92 |
| Base 3 | 10111122221 |
| As time | 69010 seconds = 19 h 10 min 10 s |
Is 69010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69010 ÷ 2 = 34505) | 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 | Yes (69010 ÷ 5 = 13802) | 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 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 2) | 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 | Yes (69010 ÷ 10 = 6901) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 69010 a prime number?
No. 69010 = 2 × 5 × 67 × 103, so it is divisible by 2.
What are the factors of 69010?
1, 2, 5, 10, 67, 103, 134, 206, 335, 515, 670, 1030, 6901, 13802, 34505, 69010.
What is 69010 in binary?
10000110110010010 (hexadecimal 10D92, octal 206622).
What is the square root of 69010?
About 262.6975.
Is 69010 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 69010?
It is a composite number with 16 divisors.