Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,152; 200,000,000,636) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,152 = 23 × 32 × 7 × 198,413
100,000,152 is not a prime number but a composite one.
200,000,000,636 = 22 × 41 × 1,219,512,199
200,000,000,636 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,636 ÷ 100,000,152 = 1,999 + 99,696,788
Step 2. Divide the smaller number by the above operation's remainder:
100,000,152 ÷ 99,696,788 = 1 + 303,364
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,696,788 ÷ 303,364 = 328 + 193,396
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
303,364 ÷ 193,396 = 1 + 109,968
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
193,396 ÷ 109,968 = 1 + 83,428
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
109,968 ÷ 83,428 = 1 + 26,540
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
83,428 ÷ 26,540 = 3 + 3,808
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
26,540 ÷ 3,808 = 6 + 3,692
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,808 ÷ 3,692 = 1 + 116
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,692 ÷ 116 = 31 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
116 ÷ 96 = 1 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 20 = 4 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 16 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 4 = 4 + 0
At this step, the remainder is zero, so we stop:
4 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,152; 200,000,000,636) = 4 = 22
The two numbers have common prime factors