Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,148; 200,000,000,454) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,148 = 22 × 41 × 609,757
100,000,148 is not a prime number but a composite one.
200,000,000,454 = 2 × 3 × 1,223 × 27,255,383
200,000,000,454 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,454 ÷ 100,000,148 = 1,999 + 99,704,602
Step 2. Divide the smaller number by the above operation's remainder:
100,000,148 ÷ 99,704,602 = 1 + 295,546
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,704,602 ÷ 295,546 = 337 + 105,600
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
295,546 ÷ 105,600 = 2 + 84,346
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
105,600 ÷ 84,346 = 1 + 21,254
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
84,346 ÷ 21,254 = 3 + 20,584
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,254 ÷ 20,584 = 1 + 670
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,584 ÷ 670 = 30 + 484
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
670 ÷ 484 = 1 + 186
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
484 ÷ 186 = 2 + 112
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
186 ÷ 112 = 1 + 74
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
112 ÷ 74 = 1 + 38
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
74 ÷ 38 = 1 + 36
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
38 ÷ 36 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
36 ÷ 2 = 18 + 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,148; 200,000,000,454) = 2
The two numbers have common prime factors