What is the Greatest Common Factor of 53268 and 53273?

Greatest common factor (GCF) of 53268 and 53273 is 1.

GCF(53268,53273) = 1

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

How to find the GCF of 53268 and 53273?

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

Step-1: Prime Factorization of 53268

Prime factors of 53268 are 2, 3, 23, 193. Prime factorization of 53268 in exponential form is:

53268 = 2² × 3¹ × 23¹ × 193¹

Step-2: Prime Factorization of 53273

Prime factors of 53273 are 11, 29, 167. Prime factorization of 53273 in exponential form is:

53273 = 11¹ × 29¹ × 167¹

Step-3: Factors of 53268

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

1, 2, 3, 4, 6, 12, 23, 46, 69, 92, 138, 193, 276, 386, 579, 772, 1158, 2316, 4439, 8878, 13317, 17756, 26634

Step-4: Factors of 53273

List of positive integer factors of 53273 that divides 53268 without a remainder.

1, 11, 29, 167, 319, 1837, 4843

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 53268 and 53273