You can divide the interval $[1,2]$ into $n$ parts in geometric progression: set $r=\sqrt[n]{2}$ and consider
$$
x_0=1<x_1=r<x_2=r^2<\dots<x_{n-1}=r^{n-1}<x_n=r^n=2
$$
The Riemann sum corresponding to taking the right extreme of the intervals is
$$
\sum_{k=1}^n(x_k-x_{k-1})f(x_k)=
\sum_{k=1}^n(r^k-r^{k-1})\frac{1}{r^k}=n\left(1-\frac{1}{r}\right)
$$
If you use the left extreme of the intervals, you get
$$
\sum_{k=1}^n(x_k-x_{k-1})f(x_{k-1})=
\sum_{k=1}^n(r^k-r^{k-1})\frac{1}{r^{k-1}}=n(r-1)=n(\sqrt[n]{2}-1)
$$
Just to make a try, let $n=2^{10}$; then we can easily compute $\sqrt[n]{2}$ by just pressing ten times the square root key on a pocket calculator, getting $1.000677130693066$; subtract $1$ and multiply by $2^{10}=1024$, getting $0.69338182970368$.
With the “lower Riemann sum” we obtain $0.6929126372864$.
If, with the same calculator, I ask for the natural logarithm of $2$, I get $0.693147180559945$; the average between the above values is $0.69314723349504$.
Pretty good, isn't it?