How to find Prime factors of a number in c in best available approach?

Question

For Example:
the prime divisors of 450 are 4,5,3,3,2.

Answer 1

#include <stdio.h>

int main()
{

    int number,div;    
    printf("Enter a number to know its prime factor: ");    
    scanf("%d",&number);

    printf("\nThe prime factors of %d are: \n\n",number);

    div = 2;

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