I solved this after reading the chapter on the symmetric group at the notes at
Group Theory and the Rubik's Cube
Here is the solution:
Let's name each cubie (the 26 small cubes in the Rubik's cube) by its visible faces in clockwise order (E.g., looking at the front face, the left corner cubie in the top row is flu).
Now, let's write D, R and DR moves as disjoint cycle decompositions of the permutation of the cubies when apply the move.
D = (dlf dfr drb dbl)(df dr db dl)
R = (rfu rub rbd rdf)(ru rb rd rf)
Now, computing DR.
D(rfu)=rfu (because D won't affect the rfu cubie)
=>DR = (dlf rfu rub rbd dbl)(drf)(df rf ru rb rd db dl)
Got that DR can be decomposed to 3 disjoint cycles.
The first cycle has 5 supports, but this cycle need to be applied 3 times because each cycle (5 times performing DR) will twist the colors. So, need to perform a multiple of 5*3=15 DR moves for returning the cubies in the first cycle to the starting point.
The second cycle has 1 support and need to be applied a multiple of 3 times for colors to be oriented as in the starting position.
The third cycle has 7 supports and can be applied 1 time because it don't changing the orientation of the colors.
Thus, the total order of DR is the least common multiplier of 15,3, and 7. This equals 105.