Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,206; 200,000,000,822) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,206 = 2 × 32 × 5,555,567
100,000,206 is not a prime number but a composite one.
200,000,000,822 = 2 × 100,000,000,411
200,000,000,822 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,822 ÷ 100,000,206 = 1,999 + 99,589,028
Step 2. Divide the smaller number by the above operation's remainder:
100,000,206 ÷ 99,589,028 = 1 + 411,178
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,589,028 ÷ 411,178 = 242 + 83,952
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
411,178 ÷ 83,952 = 4 + 75,370
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
83,952 ÷ 75,370 = 1 + 8,582
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
75,370 ÷ 8,582 = 8 + 6,714
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,582 ÷ 6,714 = 1 + 1,868
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,714 ÷ 1,868 = 3 + 1,110
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,868 ÷ 1,110 = 1 + 758
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,110 ÷ 758 = 1 + 352
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
758 ÷ 352 = 2 + 54
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
352 ÷ 54 = 6 + 28
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
54 ÷ 28 = 1 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
28 ÷ 26 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,206; 200,000,000,822) = 2
The two numbers have common prime factors