The number 69020
69020 is a composite number with 48 divisors. Its prime factorisation is × 5 × 7 × 17 × 29. Divisors (48): 1, 2, 4, 5, 7, 10, 14, 17, 20, 28, 29, 34, 35, 58, 68, 70 … 69020.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69020: a Harshad number: divisible by its digit sum 17.
- 2
69020 is composite. Its prime factorisation is
- 3
The divisors add up to 181440; without 69020 itself that is 112420, so 69020 is abundant (112420 is more than 69020). Euler's totient φ(69020) = 21504 numbers up to 69020 share no factor with it.
- 4
The digits of 69020 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 236 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69020 = 2^{2} \times 5 \times 7 \times 17 \times 29 \]69020 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 181440 |
| Euler totient φ(n) | 21504 |
| Square | 4763760400 |
| Cube | 328794742808000 |
| Square root | 262.716577 (= 2√17255) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 236 |
| Scientific notation | 6.902 × |
69020 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and twenty |
| Binary (base 2) | 10000110110011100 |
| Octal (base 8) | 206634 |
| Hexadecimal (base 16) | 10D9C |
| Base 3 | 10111200022 |
| As time | 69020 seconds = 19 h 10 min 20 s |
Is 69020 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69020 ÷ 2 = 34510) | 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 | Yes (69020 ÷ 4 = 17255) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69020 ÷ 5 = 13804) | 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 | Yes (69020 ÷ 7 = 9860) | 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 4) | 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 (69020 ÷ 10 = 6902) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69020 a prime number?
No. 69020 = × 5 × 7 × 17 × 29, so it is divisible by 2.
What are the factors of 69020?
1, 2, 4, 5, 7, 10, 14, 17, 20, 28, 29, 34, 35, 58, 68, 70, 85, 116, 119, 140, 145, 170, 203, 238, 290, 340, 406, 476, 493, 580, 595, 812, 986, 1015, 1190, 1972, 2030, 2380, 2465, 3451, 4060, 4930, 6902, 9860, 13804, 17255, 34510, 69020.
What is 69020 in binary?
10000110110011100 (hexadecimal 10D9C, octal 206634).
What is the square root of 69020?
About 262.7166, exactly 2√17255.
Is 69020 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 69020?
69020 is a Harshad number: divisible by its digit sum 17.