Can anybody ans this question

Detect whether a given positive integer N can be written as a
product of powers of 2, 3 and 5. That is, check whether N is exactly
equal to

2^i x 3^j x 5^k

where i>=0, j>=0, and k>=0 are non-negative integers.

If yes, then print
i#j#k
Otherwise, print
no

You can assume that N<9999.

#include<stdio.h>
#include<stdbool.h>
#include<math.h>

bool isPower(int n)
{
  
  if (n <= 1) return true;
  for (int x=2; x<=sqrt(n); x++)
  {
    unsigned p = x;
    while ( p <= n)
    {
      p *= x;
      if (p==n)
        return true;
    }
  }
  return false;
}

int main()
{
  int x,n;
  for (int i=2; i<100; i++)
    if (isPower(i))
    printf("i");
    return 0;
}