Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,144; 200,000,000,360) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,144 = 24 × 6,250,009
100,000,144 is not a prime number but a composite one.
200,000,000,360 = 23 × 5 × 131 × 521 × 73,259
200,000,000,360 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,360 ÷ 100,000,144 = 1,999 + 99,712,504
Step 2. Divide the smaller number by the above operation's remainder:
100,000,144 ÷ 99,712,504 = 1 + 287,640
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,712,504 ÷ 287,640 = 346 + 189,064
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
287,640 ÷ 189,064 = 1 + 98,576
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
189,064 ÷ 98,576 = 1 + 90,488
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
98,576 ÷ 90,488 = 1 + 8,088
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
90,488 ÷ 8,088 = 11 + 1,520
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,088 ÷ 1,520 = 5 + 488
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,520 ÷ 488 = 3 + 56
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
488 ÷ 56 = 8 + 40
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
56 ÷ 40 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
40 ÷ 16 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,144; 200,000,000,360) = 8 = 23
The two numbers have common prime factors