Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,526; 200,000,000,124) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,526 = 2 × 29 × 1,724,147
100,000,526 is not a prime number but a composite one.
200,000,000,124 = 22 × 35 × 19 × 53 × 204,331
200,000,000,124 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,124 ÷ 100,000,526 = 1,999 + 98,948,650
Step 2. Divide the smaller number by the above operation's remainder:
100,000,526 ÷ 98,948,650 = 1 + 1,051,876
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
98,948,650 ÷ 1,051,876 = 94 + 72,306
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,051,876 ÷ 72,306 = 14 + 39,592
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,306 ÷ 39,592 = 1 + 32,714
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
39,592 ÷ 32,714 = 1 + 6,878
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,714 ÷ 6,878 = 4 + 5,202
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,878 ÷ 5,202 = 1 + 1,676
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,202 ÷ 1,676 = 3 + 174
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,676 ÷ 174 = 9 + 110
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
174 ÷ 110 = 1 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
110 ÷ 64 = 1 + 46
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 46 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
46 ÷ 18 = 2 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 10 = 1 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 8 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
8 ÷ 2 = 4 + 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,526; 200,000,000,124) = 2
The two numbers have common prime factors