Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,120; 199,999,999,976) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,120 = 23 × 5 × 11 × 17 × 29 × 461
100,000,120 is not a prime number but a composite one.
199,999,999,976 = 23 × 7 × 359 × 367 × 27,107
199,999,999,976 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:
199,999,999,976 ÷ 100,000,120 = 1,999 + 99,760,096
Step 2. Divide the smaller number by the above operation's remainder:
100,000,120 ÷ 99,760,096 = 1 + 240,024
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,760,096 ÷ 240,024 = 415 + 150,136
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
240,024 ÷ 150,136 = 1 + 89,888
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
150,136 ÷ 89,888 = 1 + 60,248
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
89,888 ÷ 60,248 = 1 + 29,640
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
60,248 ÷ 29,640 = 2 + 968
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
29,640 ÷ 968 = 30 + 600
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
968 ÷ 600 = 1 + 368
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
600 ÷ 368 = 1 + 232
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
368 ÷ 232 = 1 + 136
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
232 ÷ 136 = 1 + 96
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
136 ÷ 96 = 1 + 40
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
96 ÷ 40 = 2 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
40 ÷ 16 = 2 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,120; 199,999,999,976) = 8 = 23
The two numbers have common prime factors