Proposition: If n is a product of two unequal prime numbers, then it has exactly 4 divisors.
Converse: If n has exactly 4 divisors, then it is a product of two unequal prime numbers.
The proposition is true. Let n=pq with p and q different primes. Any divisor of pq can use only the primes p and q, each at most once, so the divisors are 1, p, q and pq. These are four different numbers. For example, 15=3×5 has divisors 1, 3, 5, 15.
The converse is false. Counterexample: n=8. Its divisors are 1, 2, 4, 8 — exactly 4 — but 8=2×2×2 is not a product of two unequal primes. (Another counterexample: 27, with divisors 1, 3, 9, 27.)
So the proposition is true and its converse is false.