Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,036; 200,000,000,430) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,036 = 22 × 25,000,009
100,000,036 is not a prime number but a composite one.
200,000,000,430 = 2 × 32 × 5 × 419 × 5,303,633
200,000,000,430 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,430 ÷ 100,000,036 = 1,999 + 99,928,466
Step 2. Divide the smaller number by the above operation's remainder:
100,000,036 ÷ 99,928,466 = 1 + 71,570
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,928,466 ÷ 71,570 = 1,396 + 16,746
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
71,570 ÷ 16,746 = 4 + 4,586
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,746 ÷ 4,586 = 3 + 2,988
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,586 ÷ 2,988 = 1 + 1,598
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,988 ÷ 1,598 = 1 + 1,390
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,598 ÷ 1,390 = 1 + 208
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,390 ÷ 208 = 6 + 142
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
208 ÷ 142 = 1 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
142 ÷ 66 = 2 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 10 = 6 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 6 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,036; 200,000,000,430) = 2
The two numbers have common prime factors