Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,632) = ?
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,632 = 23 × 709 × 35,260,931
200,000,000,632 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,632 ÷ 100,000,052 = 1,999 + 99,896,684
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,684 = 1 + 103,368
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,684 ÷ 103,368 = 966 + 43,196
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,368 ÷ 43,196 = 2 + 16,976
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
43,196 ÷ 16,976 = 2 + 9,244
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,976 ÷ 9,244 = 1 + 7,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,244 ÷ 7,732 = 1 + 1,512
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,732 ÷ 1,512 = 5 + 172
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,512 ÷ 172 = 8 + 136
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
172 ÷ 136 = 1 + 36
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
136 ÷ 36 = 3 + 28
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
36 ÷ 28 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
28 ÷ 8 = 3 + 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,632) = 4 = 22
The two numbers have common prime factors