How to express this statement into logical notation? Statement:
Natural numbers that are exactly divisible by 2 are not prime.
I got this:
∀n ∈ N,¬P(n)∧(n%4)
where P(n) is the predicate "n is a prime number"
and N is the set of natural numbers.
And how would I write this using implication?
Also, what would be the contrapositive and converse?
Thank you!

I'm not sure what '%' means, but your statement reads "For all natural numbers $n$, $n$ is not prime and $n$%4".  This isn't exactly the statement you had in words.
Using implication:
$$ (n \in \mathbb{N} \wedge 2 \mid n) \implies \neg P(n), $$
where $P(n)$ is the predicate you defined.  Note that this isn't a true statement (2 is prime).
The contrapositive reads "If a natural number $n$ is prime, then $n$ is not exactly divisible by 2".
The converse reads "If a natural number $n$ is not prime, then $n$ is exactly divisible by 2".
