C++ :

#include<iostream>
#include<algorithm>
using namespace std;
#define N 4
int p[N]={1,4,9,9};
int isPrime(int n) {
	for(int i=2;i*i<=n;i++) {
		if(n % i == 0)
			return 0;
	}
	return 1;
}

int main() {
	int count=0;
	do{
		if(isPrime(p[0]*1000+p[1]*100+p[2]*10+p[3])) {
			count++;
		}
	}
	while(next_permutation(p,p+N));
		cout<<count;
		return 0;
}

Java :

public class Main{
	public static void main(String []args){
		int a[]={1499,1949,1994,4199,4919,4991,9149,9419,9914,9941,9194,9491};
		int count=0;
		for(int i=0;i<a.length;i++){
			if(f(a[i])){//System.out.println(a[i]);
			++count;}
		}
		System.out.println(count);
		
		
	}
	public static boolean f(int n){
		boolean b=true;
		for(int i=2;i<n;i++){
			if(n%i==0) {b=false; 
			break;}
		}
		return b;
	}
}