The number 69140
69140 is a composite number with 12 divisors. Its prime factorisation is × 5 × 3457. Divisors (12): 1, 2, 4, 5, 10, 20, 3457, 6914, 13828, 17285, 34570, 69140.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69140: a Harshad number: divisible by its digit sum 20.
- 2
69140 is composite. Its prime factorisation is
- 3
The divisors add up to 145236; without 69140 itself that is 76096, so 69140 is abundant (76096 is more than 69140). Euler's totient φ(69140) = 27648 numbers up to 69140 share no factor with it.
- 4
The digits of 69140 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69140 = 2^{2} \times 5 \times 3457 \]69140 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 145236 |
| Euler totient φ(n) | 27648 |
| Square | 4780339600 |
| Cube | 330512679944000 |
| Square root | 262.944861 (= 2√17285) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.914 × |
69140 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and forty |
| Binary (base 2) | 10000111000010100 |
| Octal (base 8) | 207024 |
| Hexadecimal (base 16) | 10E14 |
| Base 3 | 10111211202 |
| As time | 69140 seconds = 19 h 12 min 20 s |
Is 69140 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69140 ÷ 2 = 34570) | 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 (69140 ÷ 4 = 17285) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69140 ÷ 5 = 13828) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69140 ÷ 10 = 6914) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69140 a prime number?
No. 69140 = × 5 × 3457, so it is divisible by 2.
What are the factors of 69140?
1, 2, 4, 5, 10, 20, 3457, 6914, 13828, 17285, 34570, 69140.
What is 69140 in binary?
10000111000010100 (hexadecimal 10E14, octal 207024).
What is the square root of 69140?
About 262.9449, exactly 2√17285.
Is 69140 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 69140?
69140 is a Harshad number: divisible by its digit sum 20.