Multi-Dimensional Array Prime Checker

package primenumbers;

import java.util.Scanner;

public class PrimeNumbers {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int[][] numbers = new int[3][3];
        for (int row = 0; row < numbers.length; row++) {
            for (int col = 0; col < numbers[row].length; col++) {
                int realRow = row + 1;
                int realCol = col + 1;
                System.out.println("Enter number for row " + realRow + " column " + realCol);
                numbers[row][col] = input.nextInt();
            }
        }

        for (int row = 0; row < numbers.length; row++) {
            for (int col = 0; col < numbers[row].length; col++) {
                System.out.print(numbers[row][col] + "\t");
            }
            System.out.println("\n");
        }

        int primeCount = 0;
        for (int row = 0; row < numbers.length; row++) {
            for (int col = 0; col < numbers[row].length; col++) {
                int number = numbers[row][col];
                boolean isNotPrime = false;
                for (int i = 2; i <= number / 2; ++i) {
                    if (number % i == 0) {
                        isNotPrime = true;
                        break;
                    }
                }
                if (isNotPrime) {
                    System.out.print("Not prime\t");
                } else {
                    primeCount += 1;
                    System.out.print("Prime\t\t");
                }
            }
            System.out.println("\n");
        }
        System.out.println("There is " + primeCount + " prime numbers");
    }

}