Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (92,469; 123,734) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
92,469 = 3 × 13 × 2,371
92,469 is not a prime number but a composite one.
123,734 = 2 × 13 × 4,759
123,734 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
123,734 ÷ 92,469 = 1 + 31,265
Step 2. Divide the smaller number by the above operation's remainder:
92,469 ÷ 31,265 = 2 + 29,939
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
31,265 ÷ 29,939 = 1 + 1,326
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
29,939 ÷ 1,326 = 22 + 767
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,326 ÷ 767 = 1 + 559
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
767 ÷ 559 = 1 + 208
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
559 ÷ 208 = 2 + 143
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
208 ÷ 143 = 1 + 65
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
143 ÷ 65 = 2 + 13
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
65 ÷ 13 = 5 + 0
At this step, the remainder is zero, so we stop:
13 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (92,469; 123,734) = 13
The two numbers have common prime factors