Approaching Euler totient for arbitrary n From this article on Sum of Euler totient function we have the following tree:

We know that if $p$ is prime, $\phi(p) = p - 1$, that is, $\phi(11) = 11 - 1 = 10$. 
It's obvious that the above tree has a main stem and the $\phi$ branches finally reach this stem. The important number to obtain is the power of $2$ at which the $\phi$ of a number reach to the stem. This would  help to determine the $\phi(n)$ for arbitrary n, specifically if it becomes possible, it would lead to prime numbers identification.
Another important note can be the reverse scan of tree. As an example, consider the number $4$ in the main stem. The numbers ${5, 13, 11}$ reach to main stem on number $4$. What if we could obtain that list for arbitrary $2^n$?
Any solution to these problems?

Factoring and computing the Euler totient function are known to be equivalent for arbitrary numbers, not just semiprimes. See the response here: https://mathoverflow.net/questions/3274/how-hard-is-it-to-compute-the-euler-totient-function
You can see some approaches and algorithms here: http://en.wikipedia.org/wiki/Euler's_totient_function or http://mathworld.wolfram.com/TotientFunction.html
This might also be useful in exploring the problem more: http://oeis.org/A000010
Here is a calculator for up to 20 digit numbers: http://www.javascripter.net/math/calculators/eulertotientfunction.htm
You could always use a Computer Algebra System (CAS) or use WA: http://www.wolframalpha.com/input/?i=euler+totient+function+of+1234567890
Lastly, you could type things like this in WA: Table[{k, EulerPhi[k]}, {k,0,100}].
Regards - A
