Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,030; 200,000,000,603) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,030 = 2 × 5 × 13 × 769,231
100,000,030 is not a prime number but a composite one.
200,000,000,603 = 13 × 137 × 7,517 × 14,939
200,000,000,603 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,603 ÷ 100,000,030 = 1,999 + 99,940,633
Step 2. Divide the smaller number by the above operation's remainder:
100,000,030 ÷ 99,940,633 = 1 + 59,397
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,940,633 ÷ 59,397 = 1,682 + 34,879
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
59,397 ÷ 34,879 = 1 + 24,518
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
34,879 ÷ 24,518 = 1 + 10,361
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,518 ÷ 10,361 = 2 + 3,796
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,361 ÷ 3,796 = 2 + 2,769
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,796 ÷ 2,769 = 1 + 1,027
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,769 ÷ 1,027 = 2 + 715
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,027 ÷ 715 = 1 + 312
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
715 ÷ 312 = 2 + 91
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
312 ÷ 91 = 3 + 39
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
91 ÷ 39 = 2 + 13
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
39 ÷ 13 = 3 + 0
At this step, the remainder is zero, so we stop:
13 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,030; 200,000,000,603) = 13
The two numbers have common prime factors