On the Sum of Digits of Numerators of Bernoulli Numbers Let $b\gt 1$ be an integer. We prove that for almost all $n$, the sum of the digits in base $b$ of the numerator of the Bernoulli number $B_{2n}$ exceeds $c\log n$, where $c:=c(b)\gt 0$ is some constant depending on $b$. Keywords:Bernoulli numbers, sums of digitsCategory:11B68