(If your context does not include negative numbers, turn all the negatives below positive. This almost won't change the discussion.)
Everything divides zero, so zero can't be prime. $0 \cdot 7 = 0$ means $0$ and $7$ divide $0$. $0 \cdot -8 = 0$ means minus eight also divides zero. Can we see that everything divides zero, so zero is very far from being prime.
Primes are numbers that are divisible by exactly two different positive numbers. (Note that this also holds true for negative integers that are prime.) Every number is divisible by one, so that must be one of the positive divisors of a prime. Every number is divisible by its magnitude ("itself" if only talking about positives), so that must be the other positive divisor of a prime. Non-primes must have more positive divisors. If we take all the positive numbers bigger than one, take them in pairs and multiply them together, we get all the non-primes.
\begin{align*}
2 \cdot 2 &= 4, 2 \cdot 3 = 6, 2 \cdot 4 = 8, \dots \\
3 \cdot 2 &= 6, 3 \cdot 3 = 9, 3 \cdot 4 = 12, \dots
\end{align*}
(This could be a good time to remind/discuss multiples of a number and to remind/discuss commutativity of multiplication to reduce redundant calculations.)
\begin{align*}
4 \cdot 4 &= 16, 4 \cdot 5 = 20, 4 \cdot 6 = 24, \dots \\
5 \cdot 5 &= 25, 5 \cdot 6 = 30, 5 \cdot 7 = 35, \dots
\end{align*}
Here might be a good time to point out that the smallest number we get in each of these lists is the square of the number used in every product on that row. And the products get larger as we go to the right. So is it possible that there are any composites less than $25$ we have missed?
Let's list our composites up to $10$: \begin{align*}
4 = 2 \cdot 2 &\text{, so $2$ also divides $4$.} \\
6 = 2 \cdot 3 &\text{, so $2$ also divides $6$.} \\
8 = 2 \cdot 4 &\text{, so $2$ and $4$ also divide $8$.} \\
9 = 3 \cdot 3 &\text{, so $3$ also divides $9$.}
\end{align*}
This means the ones we did not produce in the table above, $2$, $3$, $5$, and $7$ must be prime -- they are only divisible by $1$ and themselves.
We can test this by checking each one for divisibility by smaller numbers. For two, there is nothing to check since there are no smaller positive numbers between one and two, so two is prime. For three, we see that two does not divide three, so three is prime. For five, we check two, three, and four, and discover five is prime. (This is a good time to notice that if four divides five, then two divides five, so we really only need to test for divisibility by primes.) We easily check that seven has no divisors among two, three, four, five, and six.
(This could be a good time to discuss that we only need to test divisors whose square is smaller than seven, otherwise the cofactor is smaller and we have already checked the smaller potential divisors.)