Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,072; 200,000,000,476) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,072 = 23 × 73 × 171,233
100,000,072 is not a prime number but a composite one.
200,000,000,476 = 22 × 317 × 1,559 × 101,173
200,000,000,476 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,476 ÷ 100,000,072 = 1,999 + 99,856,548
Step 2. Divide the smaller number by the above operation's remainder:
100,000,072 ÷ 99,856,548 = 1 + 143,524
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,856,548 ÷ 143,524 = 695 + 107,368
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
143,524 ÷ 107,368 = 1 + 36,156
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
107,368 ÷ 36,156 = 2 + 35,056
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,156 ÷ 35,056 = 1 + 1,100
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
35,056 ÷ 1,100 = 31 + 956
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,100 ÷ 956 = 1 + 144
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
956 ÷ 144 = 6 + 92
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
144 ÷ 92 = 1 + 52
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
92 ÷ 52 = 1 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
52 ÷ 40 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 12 = 3 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 4 = 3 + 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,072; 200,000,000,476) = 4 = 22
The two numbers have common prime factors