Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,048; 199,999,999,906) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,048 = 24 × 31 × 37 × 5,449
100,000,048 is not a prime number but a composite one.
199,999,999,906 = 2 × 7 × 4,817 × 2,965,687
199,999,999,906 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,906 ÷ 100,000,048 = 1,999 + 99,903,954
Step 2. Divide the smaller number by the above operation's remainder:
100,000,048 ÷ 99,903,954 = 1 + 96,094
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,903,954 ÷ 96,094 = 1,039 + 62,288
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
96,094 ÷ 62,288 = 1 + 33,806
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,288 ÷ 33,806 = 1 + 28,482
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
33,806 ÷ 28,482 = 1 + 5,324
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,482 ÷ 5,324 = 5 + 1,862
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,324 ÷ 1,862 = 2 + 1,600
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,862 ÷ 1,600 = 1 + 262
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,600 ÷ 262 = 6 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
262 ÷ 28 = 9 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 10 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 8 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 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,048; 199,999,999,906) = 2
The two numbers have common prime factors