Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,646) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,042 = 2 × 50,000,021
100,000,042 is not a prime number but a composite one.
200,000,000,646 = 2 × 32 × 23 × 83 × 5,820,383
200,000,000,646 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,646 ÷ 100,000,042 = 1,999 + 99,916,688
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,688 = 1 + 83,354
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,688 ÷ 83,354 = 1,198 + 58,596
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,354 ÷ 58,596 = 1 + 24,758
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
58,596 ÷ 24,758 = 2 + 9,080
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,758 ÷ 9,080 = 2 + 6,598
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,080 ÷ 6,598 = 1 + 2,482
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,598 ÷ 2,482 = 2 + 1,634
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,482 ÷ 1,634 = 1 + 848
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,634 ÷ 848 = 1 + 786
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
848 ÷ 786 = 1 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
786 ÷ 62 = 12 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 42 = 1 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 20 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 2 = 10 + 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,042; 200,000,000,646) = 2
The two numbers have common prime factors