Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (24,000,155; 239,999,999,943) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
24,000,155 = 5 × 23 × 208,697
24,000,155 is not a prime number but a composite one.
239,999,999,943 = 3 × 11 × 29 × 250,783,699
239,999,999,943 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).
But the two numbers have no common prime factors.
Step 1. Divide the larger number by the smaller one:
239,999,999,943 ÷ 24,000,155 = 9,999 + 22,450,098
Step 2. Divide the smaller number by the above operation's remainder:
24,000,155 ÷ 22,450,098 = 1 + 1,550,057
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
22,450,098 ÷ 1,550,057 = 14 + 749,300
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,550,057 ÷ 749,300 = 2 + 51,457
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
749,300 ÷ 51,457 = 14 + 28,902
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
51,457 ÷ 28,902 = 1 + 22,555
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,902 ÷ 22,555 = 1 + 6,347
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
22,555 ÷ 6,347 = 3 + 3,514
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,347 ÷ 3,514 = 1 + 2,833
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,514 ÷ 2,833 = 1 + 681
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,833 ÷ 681 = 4 + 109
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
681 ÷ 109 = 6 + 27
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
109 ÷ 27 = 4 + 1
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
27 ÷ 1 = 27 + 0
At this step, the remainder is zero, so we stop:
1 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 (24,000,155; 239,999,999,943) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common