Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,077; 200,000,000,562) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,077 = 3 × 33,333,359
100,000,077 is not a prime number but a composite one.
200,000,000,562 = 2 × 3 × 59 × 564,971,753
200,000,000,562 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,562 ÷ 100,000,077 = 1,999 + 99,846,639
Step 2. Divide the smaller number by the above operation's remainder:
100,000,077 ÷ 99,846,639 = 1 + 153,438
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,846,639 ÷ 153,438 = 650 + 111,939
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
153,438 ÷ 111,939 = 1 + 41,499
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
111,939 ÷ 41,499 = 2 + 28,941
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
41,499 ÷ 28,941 = 1 + 12,558
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,941 ÷ 12,558 = 2 + 3,825
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,558 ÷ 3,825 = 3 + 1,083
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,825 ÷ 1,083 = 3 + 576
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,083 ÷ 576 = 1 + 507
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
576 ÷ 507 = 1 + 69
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
507 ÷ 69 = 7 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
69 ÷ 24 = 2 + 21
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 21 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
21 ÷ 3 = 7 + 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,077; 200,000,000,562) = 3
The two numbers have common prime factors