Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,172; 200,000,000,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,172 = 22 × 31 × 806,453
100,000,172 is not a prime number but a composite one.
200,000,000,970 = 2 × 32 × 5 × 7 × 112 × 2,623,639
200,000,000,970 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:
200,000,000,970 ÷ 100,000,172 = 1,999 + 99,657,142
Step 2. Divide the smaller number by the above operation's remainder:
100,000,172 ÷ 99,657,142 = 1 + 343,030
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,657,142 ÷ 343,030 = 290 + 178,442
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
343,030 ÷ 178,442 = 1 + 164,588
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
178,442 ÷ 164,588 = 1 + 13,854
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
164,588 ÷ 13,854 = 11 + 12,194
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,854 ÷ 12,194 = 1 + 1,660
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,194 ÷ 1,660 = 7 + 574
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,660 ÷ 574 = 2 + 512
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
574 ÷ 512 = 1 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
512 ÷ 62 = 8 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 16 = 3 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 14 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 2 = 7 + 0
At this step, the remainder is zero, so we stop:
2 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 (100,000,172; 200,000,000,970) = 2
The two numbers have common prime factors