Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,851) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,054 = 2 × 7 × 11 × 127 × 5,113
100,000,054 is not a prime number but a composite one.
200,000,000,851 = 7 × 263 × 607 × 178,973
200,000,000,851 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,851 ÷ 100,000,054 = 1,999 + 99,892,905
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,892,905 = 1 + 107,149
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,892,905 ÷ 107,149 = 932 + 30,037
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,149 ÷ 30,037 = 3 + 17,038
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
30,037 ÷ 17,038 = 1 + 12,999
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,038 ÷ 12,999 = 1 + 4,039
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,999 ÷ 4,039 = 3 + 882
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,039 ÷ 882 = 4 + 511
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
882 ÷ 511 = 1 + 371
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
511 ÷ 371 = 1 + 140
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
371 ÷ 140 = 2 + 91
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
140 ÷ 91 = 1 + 49
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
91 ÷ 49 = 1 + 42
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
49 ÷ 42 = 1 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
42 ÷ 7 = 6 + 0
At this step, the remainder is zero, so we stop:
7 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,054; 200,000,000,851) = 7
The two numbers have common prime factors