Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,028; 200,000,000,622) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,028 = 22 × 113 × 221,239
100,000,028 is not a prime number but a composite one.
200,000,000,622 = 2 × 3 × 131 × 2,039 × 124,793
200,000,000,622 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,622 ÷ 100,000,028 = 1,999 + 99,944,650
Step 2. Divide the smaller number by the above operation's remainder:
100,000,028 ÷ 99,944,650 = 1 + 55,378
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,944,650 ÷ 55,378 = 1,804 + 42,738
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
55,378 ÷ 42,738 = 1 + 12,640
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
42,738 ÷ 12,640 = 3 + 4,818
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,640 ÷ 4,818 = 2 + 3,004
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,818 ÷ 3,004 = 1 + 1,814
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,004 ÷ 1,814 = 1 + 1,190
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,814 ÷ 1,190 = 1 + 624
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,190 ÷ 624 = 1 + 566
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
624 ÷ 566 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
566 ÷ 58 = 9 + 44
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 44 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
44 ÷ 14 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 2 = 7 + 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,028; 200,000,000,622) = 2
The two numbers have common prime factors