PUMaC 2021 Team Problem 13

Given a positive integer n with prime factorization p_{1}^{e_{1}} p_{2}^{e_{2}} \cdots p_{k}^{e_{k}}, we define f(n) to be \sum_{i=1}^{k} p_{i} e_{i}. In other words, f(n) is the sum of the prime divisors of n, counted with multiplicities. Let M be the largest odd integer such that f(M)=2023, and m the smallest odd integer so that f(m)=2023. Suppose that \frac{M}{m} equals p_{1}^{e_{1}} p_{2}^{e_{2}} \cdots p_{l}^{e_{l}}, where the e_{i} are all nonzero integers and the p_{i} are primes. Find \left|\sum_{i=1}^{l}\left(p_{i}+e_{i}\right)\right|.