Here is my number today:
![]() |
From Random Graphic Images |
See this post to understand why I think that figuring out why the prime factorization of my Char-Grill number is cool.
Also, since this was not too hard to figure out. I started thinking what else can I do with this number.
A good idea is to compute the value of Euler’s Totient Function at that number.
Here is the definition of
The number of positive integers less than or equal to n that are co-prime to n.
Two positive integers are co-prime if they share no common factors other than one.
So it turns out that is multiplicative which means
And it also turns out that:
If you put this together with and note that
and
then
And applying the totient function to the prime factorization of a number yields:
where
is the number of prime factors of
And now since we get