What is the Greatest Common Factor of 83238 and 83249?

Greatest common factor (GCF) of 83238 and 83249 is 1.

GCF(83238,83249) = 1

We will now calculate the prime factors of 83238 and 83249, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 83238 and 83249.

How to find the GCF of 83238 and 83249?

We will first find the prime factorization of 83238 and 83249. After we will calculate the factors of 83238 and 83249 and find the biggest common factor number .

Step-1: Prime Factorization of 83238

Prime factors of 83238 are 2, 3, 13873. Prime factorization of 83238 in exponential form is:

83238 = 2¹ × 3¹ × 13873¹

Step-2: Prime Factorization of 83249

Prime factors of 83249 are 17, 59, 83. Prime factorization of 83249 in exponential form is:

83249 = 17¹ × 59¹ × 83¹

Step-3: Factors of 83238

List of positive integer factors of 83238 that divides 83238 without a remainder.

1, 2, 3, 6, 13873, 27746, 41619

Step-4: Factors of 83249

List of positive integer factors of 83249 that divides 83238 without a remainder.

1, 17, 59, 83, 1003, 1411, 4897

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 83238 and 83249. The biggest common factor number is the GCF number.
So the greatest common factor 83238 and 83249 is 1.

Also check out the Least Common Multiple of 83238 and 83249