Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (13,717,355; 999,999,999,990) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
13,717,355 = 5 × 1,009 × 2,719
13,717,355 is not a prime number but a composite one.
999,999,999,990 = 2 × 32 × 5 × 21,649 × 513,239
999,999,999,990 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,990 ÷ 13,717,355 = 72,900 + 4,820,490
Step 2. Divide the smaller number by the above operation's remainder:
13,717,355 ÷ 4,820,490 = 2 + 4,076,375
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
4,820,490 ÷ 4,076,375 = 1 + 744,115
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
4,076,375 ÷ 744,115 = 5 + 355,800
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
744,115 ÷ 355,800 = 2 + 32,515
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
355,800 ÷ 32,515 = 10 + 30,650
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,515 ÷ 30,650 = 1 + 1,865
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
30,650 ÷ 1,865 = 16 + 810
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,865 ÷ 810 = 2 + 245
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
810 ÷ 245 = 3 + 75
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
245 ÷ 75 = 3 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
75 ÷ 20 = 3 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 15 = 1 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 5 = 3 + 0
At this step, the remainder is zero, so we stop:
5 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 (13,717,355; 999,999,999,990) = 5
The two numbers have common prime factors