Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,064; 200,000,000,196) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,064 = 26 × 1,201 × 1,301
100,000,064 is not a prime number but a composite one.
200,000,000,196 = 22 × 32 × 383 × 14,505,367
200,000,000,196 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,196 ÷ 100,000,064 = 1,999 + 99,872,260
Step 2. Divide the smaller number by the above operation's remainder:
100,000,064 ÷ 99,872,260 = 1 + 127,804
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,872,260 ÷ 127,804 = 781 + 57,336
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
127,804 ÷ 57,336 = 2 + 13,132
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
57,336 ÷ 13,132 = 4 + 4,808
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,132 ÷ 4,808 = 2 + 3,516
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,808 ÷ 3,516 = 1 + 1,292
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,516 ÷ 1,292 = 2 + 932
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,292 ÷ 932 = 1 + 360
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
932 ÷ 360 = 2 + 212
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
360 ÷ 212 = 1 + 148
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
212 ÷ 148 = 1 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
148 ÷ 64 = 2 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 20 = 3 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 4 = 5 + 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,064; 200,000,000,196) = 4 = 22
The two numbers have common prime factors