Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,060; 200,000,000,728) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,060 = 22 × 5 × 83 × 107 × 563
100,000,060 is not a prime number but a composite one.
200,000,000,728 = 23 × 112 × 109 × 887 × 2,137
200,000,000,728 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,728 ÷ 100,000,060 = 1,999 + 99,880,788
Step 2. Divide the smaller number by the above operation's remainder:
100,000,060 ÷ 99,880,788 = 1 + 119,272
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,880,788 ÷ 119,272 = 837 + 50,124
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
119,272 ÷ 50,124 = 2 + 19,024
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
50,124 ÷ 19,024 = 2 + 12,076
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,024 ÷ 12,076 = 1 + 6,948
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,076 ÷ 6,948 = 1 + 5,128
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,948 ÷ 5,128 = 1 + 1,820
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,128 ÷ 1,820 = 2 + 1,488
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,820 ÷ 1,488 = 1 + 332
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,488 ÷ 332 = 4 + 160
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
332 ÷ 160 = 2 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
160 ÷ 12 = 13 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 4 = 3 + 0
At this step, the remainder is zero, so we stop:
4 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,060; 200,000,000,728) = 4 = 22
The two numbers have common prime factors