Let a>1 be an integer. Denote by la(p) the multiplicative order of a modulo primes p. We prove that if logxloglogxx=o(y), then y1∑a≤y∑p≤xla(p)1=logx+Cloglogx+O(yloglogxx) which is an improvement over a theorem by Felix ~\cite{Fe}. Additionally, we also prove two other average results If log2x=o(ψ(x)) and x1−δlog3x=o(y), then y1∑a<y∑p<xla(p)>ψ(x)x1=π(x)+O(ψ(x)xlogx)+O(yx2−δlog2x). Furthermore, if x1−δlog3x=o(y), then y1∑a<y∑p<xp∤ala(p)=cLi(x2)+O(logAxx2)+O(yx3−δlog2x) where c=∏p(1−p3−1p).