Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,944) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,052 = 22 × 17 × 151 × 9,739
100,000,052 is not a prime number but a composite one.
200,000,000,944 = 24 × 1,277 × 9,788,567
200,000,000,944 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,944 ÷ 100,000,052 = 1,999 + 99,896,996
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,996 = 1 + 103,056
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,996 ÷ 103,056 = 969 + 35,732
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,056 ÷ 35,732 = 2 + 31,592
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
35,732 ÷ 31,592 = 1 + 4,140
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
31,592 ÷ 4,140 = 7 + 2,612
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,140 ÷ 2,612 = 1 + 1,528
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,612 ÷ 1,528 = 1 + 1,084
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,528 ÷ 1,084 = 1 + 444
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,084 ÷ 444 = 2 + 196
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
444 ÷ 196 = 2 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
196 ÷ 52 = 3 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 40 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 12 = 3 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,052; 200,000,000,944) = 4 = 22
The two numbers have common prime factors