Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (143,221,478,034; 91,307,340,704) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
143,221,478,034 = 2 × 3 × 12,227 × 1,952,257
143,221,478,034 is not a prime number but a composite one.
91,307,340,704 = 25 × 43 × 401 × 165,479
91,307,340,704 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:
143,221,478,034 ÷ 91,307,340,704 = 1 + 51,914,137,330
Step 2. Divide the smaller number by the above operation's remainder:
91,307,340,704 ÷ 51,914,137,330 = 1 + 39,393,203,374
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
51,914,137,330 ÷ 39,393,203,374 = 1 + 12,520,933,956
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
39,393,203,374 ÷ 12,520,933,956 = 3 + 1,830,401,506
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
12,520,933,956 ÷ 1,830,401,506 = 6 + 1,538,524,920
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,830,401,506 ÷ 1,538,524,920 = 1 + 291,876,586
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,538,524,920 ÷ 291,876,586 = 5 + 79,141,990
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
291,876,586 ÷ 79,141,990 = 3 + 54,450,616
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
79,141,990 ÷ 54,450,616 = 1 + 24,691,374
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
54,450,616 ÷ 24,691,374 = 2 + 5,067,868
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
24,691,374 ÷ 5,067,868 = 4 + 4,419,902
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
5,067,868 ÷ 4,419,902 = 1 + 647,966
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
4,419,902 ÷ 647,966 = 6 + 532,106
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
647,966 ÷ 532,106 = 1 + 115,860
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
532,106 ÷ 115,860 = 4 + 68,666
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
115,860 ÷ 68,666 = 1 + 47,194
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
68,666 ÷ 47,194 = 1 + 21,472
Step 18. Divide the remainder of the step 16 by the remainder of the step 17:
47,194 ÷ 21,472 = 2 + 4,250
Step 19. Divide the remainder of the step 17 by the remainder of the step 18:
21,472 ÷ 4,250 = 5 + 222
Step 20. Divide the remainder of the step 18 by the remainder of the step 19:
4,250 ÷ 222 = 19 + 32
Step 21. Divide the remainder of the step 19 by the remainder of the step 20:
222 ÷ 32 = 6 + 30
Step 22. Divide the remainder of the step 20 by the remainder of the step 21:
32 ÷ 30 = 1 + 2
Step 23. Divide the remainder of the step 21 by the remainder of the step 22:
30 ÷ 2 = 15 + 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 (143,221,478,034; 91,307,340,704) = 2
The two numbers have common prime factors