# Java Program to find the sum of prime numbers in an array

In this program, You will learn how to find the sum of prime numbers in an array in java.

`Some list of prime numbers is: 2 3 5 7 9 11 13`

## Example: How to find sum of prime numbers in an array in java.

```
import java.util.Scanner;
class Main {
public static void main(String args[]) {
int i, s, j, p, sum = 0;
int arr[] = new int[100];
Scanner sc = new Scanner(System.in);
System.out.print("Enter size of an array:");
s = sc.nextInt();
System.out.print("Enter array elements:");
for (i = 0; i < s; i++) {
arr[i] = sc.nextInt();
}
for (i = 0; i < s; i++) {
j = 2;
p = 1;
while (j < arr[i]) {
if (arr[i] % j == 0) {
p = 0;
break;
}
j++;
}
if (p == 1) {
sum = sum + arr[i];
}
}
System.out.println("Sum of all prime numbers:" + sum);
}
}
```

#### Output:

```
Enter size of an array:5
Enter array elements:2 3 4 5 6
Sum of all prime numbers:10
```