**The Program in C to find the sum of the first n prime numbers is given below:**

```
#include <stdio.h>
int main() {
int n, i, j, sum = 0, isPrime;
printf("Enter the value of n: ");
scanf("%d", &n);
for(i = 2; i <= n; i++) {
isPrime = 1;
for(j = 2; j <= i/2; j++) {
if(i % j == 0) {
isPrime = 0;
break;
}
}
if(isPrime == 1) {
sum += i;
}
}
printf("Sum of first %d prime numbers: %d", n, sum);
return 0;
}
```

## Output:

Enter the value of n: 123

Sum of first 123 prime numbers: 1593

## Pro-Tips**💡**

This program prompts the user to enter a value for n, and then uses two nested loops to determine if each number between 2 and n is prime.

If a number is prime, it is added to the sum. The final sum is then printed to the console.

**Learn C-Sharp ↗**

C-sharp covers every topic to learn about C-Sharp thoroughly.

**Learn C Programming ↗**

C-Programming covers every topic to learn about C-Sharp thoroughly.

**Learn C++ Programming↗**

**Learn C++ Programming↗**

C++ covers every topic to learn about C-Sharp thoroughly.