Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,811) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,000,811 = 3 × 13 × 11,257 × 455,557
200,000,000,811 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,811 ÷ 100,000,068 = 1,999 + 99,864,879
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,879 = 1 + 135,189
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,879 ÷ 135,189 = 738 + 95,397
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,189 ÷ 95,397 = 1 + 39,792
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
95,397 ÷ 39,792 = 2 + 15,813
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
39,792 ÷ 15,813 = 2 + 8,166
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,813 ÷ 8,166 = 1 + 7,647
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,166 ÷ 7,647 = 1 + 519
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,647 ÷ 519 = 14 + 381
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
519 ÷ 381 = 1 + 138
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
381 ÷ 138 = 2 + 105
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
138 ÷ 105 = 1 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
105 ÷ 33 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 6 = 5 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,068; 200,000,000,811) = 3
The two numbers have common prime factors