Aladdin and Euler Totient

One day, Aladdin was was challenged by Euler with a very hard maths problem. $f(N) = \sum_{i=1}^{N} (\sum_{j=1}^{i} floor(\frac{i}{j}) * \phi(j))$ Where floor() is the [Floor Function](https://mathworld.wolfram.com/FloorFunction.html) and $\phi()$ is the [Euler Totient Function](https://mathworld.wolfram.com/TotientFunction.html). Since the value of $f(N)$ could be very large, computer t