What is the Greatest Common Factor of 15364 and 15369?

Greatest common factor (GCF) of 15364 and 15369 is 1.

GCF(15364,15369) = 1

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

How to find the GCF of 15364 and 15369?

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

Step-1: Prime Factorization of 15364

Prime factors of 15364 are 2, 23, 167. Prime factorization of 15364 in exponential form is:

15364 = 2² × 23¹ × 167¹

Step-2: Prime Factorization of 15369

Prime factors of 15369 are 3, 47, 109. Prime factorization of 15369 in exponential form is:

15369 = 3¹ × 47¹ × 109¹

Step-3: Factors of 15364

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

1, 2, 4, 23, 46, 92, 167, 334, 668, 3841, 7682

Step-4: Factors of 15369

List of positive integer factors of 15369 that divides 15364 without a remainder.

1, 3, 47, 109, 141, 327, 5123

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15364 and 15369