Power of Three

Given an integer, write a function to determine if it is a power of three.
Follow up:Could you do it without using any loop / recursion?
bool isPowerOfThree(int n) { //return ( n>0 && 1162261467%n==0); return fmod(log10(n)/log10(3), 1)==0; }