What is the Greatest Common Factor of 84058 and 84073?

Greatest common factor (GCF) of 84058 and 84073 is 1.

GCF(84058,84073) = 1

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

How to find the GCF of 84058 and 84073?

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

Step-1: Prime Factorization of 84058

Prime factors of 84058 are 2, 13, 53, 61. Prime factorization of 84058 in exponential form is:

84058 = 2¹ × 13¹ × 53¹ × 61¹

Step-2: Prime Factorization of 84073

Prime factors of 84073 are 11, 7643. Prime factorization of 84073 in exponential form is:

84073 = 11¹ × 7643¹

Step-3: Factors of 84058

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

1, 2, 13, 26, 53, 61, 106, 122, 689, 793, 1378, 1586, 3233, 6466, 42029

Step-4: Factors of 84073

List of positive integer factors of 84073 that divides 84058 without a remainder.

1, 11, 7643

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84058 and 84073