Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (999,999,999,998; 9,949,999,948) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
999,999,999,998 = 2 × 2,969 × 168,406,871
999,999,999,998 is not a prime number but a composite one.
9,949,999,948 = 22 × 7 × 5,443 × 65,287
9,949,999,948 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:
999,999,999,998 ÷ 9,949,999,948 = 100 + 5,000,005,198
Step 2. Divide the smaller number by the above operation's remainder:
9,949,999,948 ÷ 5,000,005,198 = 1 + 4,949,994,750
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
5,000,005,198 ÷ 4,949,994,750 = 1 + 50,010,448
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
4,949,994,750 ÷ 50,010,448 = 98 + 48,970,846
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
50,010,448 ÷ 48,970,846 = 1 + 1,039,602
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
48,970,846 ÷ 1,039,602 = 47 + 109,552
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,039,602 ÷ 109,552 = 9 + 53,634
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
109,552 ÷ 53,634 = 2 + 2,284
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
53,634 ÷ 2,284 = 23 + 1,102
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,284 ÷ 1,102 = 2 + 80
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,102 ÷ 80 = 13 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
80 ÷ 62 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 18 = 3 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 8 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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 (999,999,999,998; 9,949,999,948) = 2
The two numbers have common prime factors