Prime Factorial of Any Number entered using recursion

primeFactorialRecursion.c

#include <stdio.h>
void pfact(int n);

int main()
{

pfact(147);

return 0;
}

void pfact(int n)
{
    int div = 2;

    while(n>1)
    {
        if(n%div !=0)
                {
                    div++;
                }
        else
            {
            printf(" %d",div);
            pfact(n/div);
            break;
            }
    }
}