Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,082; 200,000,000,510) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,082 = 2 × 72 × 13 × 53 × 1,481
100,000,082 is not a prime number but a composite one.
200,000,000,510 = 2 × 5 × 109 × 1,117 × 164,267
200,000,000,510 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,510 ÷ 100,000,082 = 1,999 + 99,836,592
Step 2. Divide the smaller number by the above operation's remainder:
100,000,082 ÷ 99,836,592 = 1 + 163,490
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,836,592 ÷ 163,490 = 610 + 107,692
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,490 ÷ 107,692 = 1 + 55,798
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
107,692 ÷ 55,798 = 1 + 51,894
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
55,798 ÷ 51,894 = 1 + 3,904
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
51,894 ÷ 3,904 = 13 + 1,142
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,904 ÷ 1,142 = 3 + 478
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,142 ÷ 478 = 2 + 186
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
478 ÷ 186 = 2 + 106
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
186 ÷ 106 = 1 + 80
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
106 ÷ 80 = 1 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
80 ÷ 26 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 2 = 13 + 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,082; 200,000,000,510) = 2
The two numbers have common prime factors