Smallest Prime Factor

Problem Statement

Let $\operatorname{smpf}(n)$ be the smallest prime factor of $n$.
$\operatorname{smpf}(91)=7$ because $91=7\times 13$ and $\operatorname{smpf}(45)=3$ because $45=3\times 3\times 5$.
Let $S(n)$ be the sum of $\operatorname{smpf}(i)$ for $2 \le i \le n$.
E.g. $S(100)=1257$.

Find $S(2^N)$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 icy
46.96 (50)
🥈 shs10978
46.96 (47)
🥉 shash4321
43.96 (44)
4 mmtg
26.96 (27)
5 jonnytang
19.96 (20)
6 CandynightJ
3.04 (4)

Data

Stats

Your submissions will appear here

Recent Submissions

1
shash4321
$g(44)$, $25$ digits 3 weeks, 6 days ago
2
shash4321
$g(43)$, $25$ digits 3 weeks, 6 days ago
3
shash4321
$g(42)$, $24$ digits 3 weeks, 6 days ago
4
shash4321
$g(41)$, $23$ digits 3 weeks, 6 days ago
5
shash4321
$g(40)$, $23$ digits 3 weeks, 6 days ago