Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,064; 200,000,000,240) = ?
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,240 = 24 × 5 × 4,933 × 506,791
200,000,000,240 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,240 ÷ 100,000,064 = 1,999 + 99,872,304
Step 2. Divide the smaller number by the above operation's remainder:
100,000,064 ÷ 99,872,304 = 1 + 127,760
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,872,304 ÷ 127,760 = 781 + 91,744
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
127,760 ÷ 91,744 = 1 + 36,016
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
91,744 ÷ 36,016 = 2 + 19,712
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,016 ÷ 19,712 = 1 + 16,304
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,712 ÷ 16,304 = 1 + 3,408
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
16,304 ÷ 3,408 = 4 + 2,672
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,408 ÷ 2,672 = 1 + 736
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,672 ÷ 736 = 3 + 464
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
736 ÷ 464 = 1 + 272
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
464 ÷ 272 = 1 + 192
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
272 ÷ 192 = 1 + 80
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
192 ÷ 80 = 2 + 32
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
80 ÷ 32 = 2 + 16
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
32 ÷ 16 = 2 + 0
At this step, the remainder is zero, so we stop:
16 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,240) = 16 = 24
The two numbers have common prime factors