（Problem 10）Summation of primes

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

#include<stdio.h>
#include<math.h>
#include<stdbool.h>

#define N 2000000

bool prim(int n)
{
    int i;
    for(i=; i*i<=n; i++)
    {
        if(n%i==)
            return false;
    }
    return true;
}

int main()
{
    int i;
    long long sum=;
    for(i=; i<=N; i=i+)
    {
        if(prim(i))
        {
            sum+=i;
        }
    }
    printf("%lld\n",sum);

    return ;
}

Answer:

142913828922