Hey guys i am pretty new to C and i created this programm to determine if a number is a Smith number. The only problem is that for big numbers it runs really slow.It takes about 10 minutes.Any idea how to improve it?Thank you in advance

Here is the code :
Code:

#include<stdio.h>
int main(){
int sum,sum1,j,j1,save,current,counter,n,many=0;
float percent;
for(counter=200000000;counter<=200010000;counter++)
{
sum=0;
sum1=0;
j=2;
current=counter;
save=current;
while(save>=10)
{ sum=sum+save%10;
save=save/10;
}
sum=sum+save;
save=current;
while(save%j==0)
{ sum1=sum1+j;
save=save/j;
}
j++;
while(save!=1)
{
while(save%j==0)
{
save=save/j;
j1=j;
while(j1>=10)
{
sum1=sum1+j1%10;
j1=j1/10;
}
sum1=sum1+j1;
}
j=j+2;
}
n=j-2;
if(sum==sum1 && current!=n) {
printf("The number %d is Smith \n",current);
many=many+1;
}
}
percent=1.0*many/100;
printf("%.4f%c Smith numbers found",percent,'%');
}