GCF for 40 and 690
"Greatest Common Factor" Calculator
What is the Greatest common Divisor of 40 and 690?
Answer: GCF of 40 and 690 is 10
(Ten)
Finding GCF for 40 and 690 using all factors (divisors) listing
The first method to find GCF for numbers 40 and 690 is to list all factors for both numbers and pick the highest common one:
All factors of 40: 1, 2, 4, 5, 8, 10, 20, 40
All factors of 690: 1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 69, 115, 138, 230, 345, 690
So the Greatest Common Factor for 40 and 690 is 10
Finding GCF for 40 and 690 by Prime Factorization
The second method to find GCF for numbers 40 and 690 is to list all Prime Factors for both numbers and multiply the common ones:
All Prime Factors of 40: 2, 2, 2, 5
All Prime Factors of 690: 2, 3, 5, 23
As we can see there are Prime Factors common to both numbers: 2, 5
Now we need to multiply them to find GCF: 2 × 5 = 10
Share This Calculation
Print
<a href="https://calculat.io/en/number/greatest-common-factor-of/40--690">What is the GCF of 40 and 690 - Calculatio</a>
GCF Table
| Number 1 | Number 2 | GCF |
|---|---|---|
| 25 | 690 | 5 |
| 26 | 690 | 2 |
| 27 | 690 | 3 |
| 28 | 690 | 2 |
| 29 | 690 | 1 |
| 30 | 690 | 30 |
| 31 | 690 | 1 |
| 32 | 690 | 2 |
| 33 | 690 | 3 |
| 34 | 690 | 2 |
| 35 | 690 | 5 |
| 36 | 690 | 6 |
| 37 | 690 | 1 |
| 38 | 690 | 2 |
| 39 | 690 | 3 |
| 40 | 690 | 10 |
| 41 | 690 | 1 |
| 42 | 690 | 6 |
| 43 | 690 | 1 |
| 44 | 690 | 2 |
| 45 | 690 | 15 |
| 46 | 690 | 46 |
| 47 | 690 | 1 |
| 48 | 690 | 6 |
| 49 | 690 | 1 |
| 50 | 690 | 10 |
| 51 | 690 | 3 |
| 52 | 690 | 2 |
| 53 | 690 | 1 |
| 54 | 690 | 6 |
About "Greatest Common Factor" Calculator
This calculator will help you find the greatest common factor (GCF) of two numbers. For example, it can help you find out what is the Greatest common Divisor of 40 and 690? (The answer is: 10). Select the first number (e.g. '40') and the second number (e.g. '690'). After that hit the 'Calculate' button.
Greatest Common Factor (GCF) also known as the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) - it is the largest positive integer that divides each of the integers with zero remainder