Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,192) = ?
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,192 = 26 × 137 × 22,810,219
200,000,000,192 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,192 ÷ 100,000,052 = 1,999 + 99,896,244
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,244 = 1 + 103,808
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,244 ÷ 103,808 = 962 + 32,948
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,808 ÷ 32,948 = 3 + 4,964
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,948 ÷ 4,964 = 6 + 3,164
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,964 ÷ 3,164 = 1 + 1,800
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,164 ÷ 1,800 = 1 + 1,364
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,800 ÷ 1,364 = 1 + 436
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,364 ÷ 436 = 3 + 56
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
436 ÷ 56 = 7 + 44
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
56 ÷ 44 = 1 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
44 ÷ 12 = 3 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 8 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 4 = 2 + 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,192) = 4 = 22
The two numbers have common prime factors