Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,047; 200,000,000,868) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,047 = 3 × 7 × 277 × 17,191
100,000,047 is not a prime number but a composite one.
200,000,000,868 = 22 × 3 × 991 × 16,818,029
200,000,000,868 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,868 ÷ 100,000,047 = 1,999 + 99,906,915
Step 2. Divide the smaller number by the above operation's remainder:
100,000,047 ÷ 99,906,915 = 1 + 93,132
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,906,915 ÷ 93,132 = 1,072 + 69,411
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
93,132 ÷ 69,411 = 1 + 23,721
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,411 ÷ 23,721 = 2 + 21,969
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,721 ÷ 21,969 = 1 + 1,752
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,969 ÷ 1,752 = 12 + 945
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,752 ÷ 945 = 1 + 807
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
945 ÷ 807 = 1 + 138
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
807 ÷ 138 = 5 + 117
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
138 ÷ 117 = 1 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
117 ÷ 21 = 5 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 12 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 9 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 3 = 3 + 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,047; 200,000,000,868) = 3
The two numbers have common prime factors