What is the Greatest Common Factor of 83058 and 83068?

Greatest common factor (GCF) of 83058 and 83068 is 2.

GCF(83058,83068) = 2

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

How to find the GCF of 83058 and 83068?

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

Step-1: Prime Factorization of 83058

Prime factors of 83058 are 2, 3, 109, 127. Prime factorization of 83058 in exponential form is:

83058 = 2¹ × 3¹ × 109¹ × 127¹

Step-2: Prime Factorization of 83068

Prime factors of 83068 are 2, 19, 1093. Prime factorization of 83068 in exponential form is:

83068 = 2² × 19¹ × 1093¹

Step-3: Factors of 83058

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

1, 2, 3, 6, 109, 127, 218, 254, 327, 381, 654, 762, 13843, 27686, 41529

Step-4: Factors of 83068

List of positive integer factors of 83068 that divides 83058 without a remainder.

1, 2, 4, 19, 38, 76, 1093, 2186, 4372, 20767, 41534

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 83058 and 83068. The biggest common factor number is the GCF number.
So the greatest common factor 83058 and 83068 is 2.

Also check out the Least Common Multiple of 83058 and 83068