GCF for 23 and 138
"Greatest Common Factor" Calculator
What is the Greatest common Divisor of 23 and 138?
Answer: GCF of 23 and 138 is 23
(Twenty-three)
Finding GCF for 23 and 138 using all factors (divisors) listing
The first method to find GCF for numbers 23 and 138 is to list all factors for both numbers and pick the highest common one:
All factors of 23: 1, 23
All factors of 138: 1, 2, 3, 6, 23, 46, 69, 138
So the Greatest Common Factor for 23 and 138 is 23
Finding GCF for 23 and 138 by Prime Factorization
The second method to find GCF for numbers 23 and 138 is to list all Prime Factors for both numbers and multiply the common ones:
All Prime Factors of 138: 2, 3, 23
As we can see there is only one Prime Factor common to both numbers. It is 23
So 23 is the Greatest Common Factor of 23 and 138
See Also
- Least Common Multiple - Find the Least Common Multiple (LCM) of two numbers
Share This Calculation
Print
<a href="https://calculat.io/en/number/greatest-common-factor-of/23--138">What is the GCF of 23 and 138 - Calculatio</a>
GCF Table
| Number 1 | Number 2 | GCF |
|---|---|---|
| 8 | 138 | 2 |
| 9 | 138 | 3 |
| 10 | 138 | 2 |
| 11 | 138 | 1 |
| 12 | 138 | 6 |
| 13 | 138 | 1 |
| 14 | 138 | 2 |
| 15 | 138 | 3 |
| 16 | 138 | 2 |
| 17 | 138 | 1 |
| 18 | 138 | 6 |
| 19 | 138 | 1 |
| 20 | 138 | 2 |
| 21 | 138 | 3 |
| 22 | 138 | 2 |
| 23 | 138 | 23 |
| 24 | 138 | 6 |
| 25 | 138 | 1 |
| 26 | 138 | 2 |
| 27 | 138 | 3 |
| 28 | 138 | 2 |
| 29 | 138 | 1 |
| 30 | 138 | 6 |
| 31 | 138 | 1 |
| 32 | 138 | 2 |
| 33 | 138 | 3 |
| 34 | 138 | 2 |
| 35 | 138 | 1 |
| 36 | 138 | 6 |
| 37 | 138 | 1 |
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 23 and 138? (The answer is: 23). Select the first number (e.g. '23') and the second number (e.g. '138'). 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