TITLE: New identity for Euler's Totient Function?
QUESTION [25 upvotes]: A few weeks ago I discovered and proved a simple identity for Euler's totient function.  I figured that someone would have already discovered it, but I haven't been able to find it anywhere.
So I was hoping someone would be able to tell me whether or not they've seen this identity.
Here it is:
$$\phi(n)=\phi(\operatorname{rad}(n))\left(\frac{n}{\operatorname{rad}(n)}\right)$$
where $\operatorname{rad}(n)$ is the radical or square-free kernel of $n$, i.e. the product of the distinct prime factors of $n$.
I have omitted the proof because firstly, I'm still learning MathJax and am afraid it will take quite a long time to type out.  And secondly, I believe it is intuitive enough that most people familiar with the totient function should be able to see that it's true.  
Like I said, it is a pretty simple identity, but nevertheless; it seems like it could be fairly useful.  It would be a bit easier to calculate $\phi(n)$ for large-ish $n$ with this identity, without the help of a program or totient function calculator.
Ex: $$\phi(450)=\phi(2\cdot3^2\cdot5^2)=\phi(2\cdot3\cdot5)\left(\frac{2\cdot3^2\cdot5^2}{2\cdot3\cdot5}\right)=(1\cdot2\cdot4)(3\cdot5)=120$$

REPLY [10 votes]: Your identity
can be written as
$$
\frac{\phi(n)}{n}=\frac{\phi(\operatorname{rad}(n))}{\operatorname{rad}(n)}
$$
In this form, it is obvious, because
$$
\frac{\phi(m)}{m}=\prod_{p\mid m}\left(1-\frac1p\right)
$$
and $n$ and $\operatorname{rad}(n)$ have exactly the same prime factors.
Still, a nice observation, well done!