What is the Greatest Common Factor of 59265 and 59272?

Greatest common factor (GCF) of 59265 and 59272 is 1.

GCF(59265,59272) = 1

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

How to find the GCF of 59265 and 59272?

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

Step-1: Prime Factorization of 59265

Prime factors of 59265 are 3, 5, 439. Prime factorization of 59265 in exponential form is:

59265 = 3³ × 5¹ × 439¹

Step-2: Prime Factorization of 59272

Prime factors of 59272 are 2, 31, 239. Prime factorization of 59272 in exponential form is:

59272 = 2³ × 31¹ × 239¹

Step-3: Factors of 59265

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

1, 3, 5, 9, 15, 27, 45, 135, 439, 1317, 2195, 3951, 6585, 11853, 19755

Step-4: Factors of 59272

List of positive integer factors of 59272 that divides 59265 without a remainder.

1, 2, 4, 8, 31, 62, 124, 239, 248, 478, 956, 1912, 7409, 14818, 29636

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 59265 and 59272