Divisibility of Factorials

Problem Statement

The smallest number $m$ such that $10$ divides $m!$ is $m=5$.
The smallest number $m$ such that $25$ divides $m!$ is $m=10$.

Let $s(n)$ be the smallest number $m$ such that $n$ divides $m!$.
So $s(10)=5$ and $s(25)=10$.
Let $S(n)$ be $\sum s(i)$ for $2 \le i \le n$.
$S(100)=2012$.

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
45.00 (50)
🥈 shs10978
45.00 (45)
🥉 mmtg
27.00 (27)
4 jonnytang
12.00 (12)

Data

Stats

Your submissions will appear here

Recent Submissions

1
mmtg
$g(27)$, $15$ digits 6 days, 14 hours ago
2
mmtg
$g(26)$, $15$ digits 6 days, 14 hours ago
3
mmtg
$g(25)$, $14$ digits 6 days, 14 hours ago
4
mmtg
$g(24)$, $14$ digits 6 days, 14 hours ago
5
mmtg
$g(23)$, $13$ digits 6 days, 14 hours ago