prime

 declare 
	a number(4):=&a;
	b number(3):=0;
	c number(3):=0;
begin
for i in 2..a loop
if a mod i	=0 then
	b:=b+1;
end if;
end loop;
if b=1 then
dbms_output.put_line('number is prime:'||a);
else
dbms_output.put_line('number is not prime:'||a);
end if;
for i in 1..(a-1) loop
	if a mod i=0 then
		c:=c+i;
	end if;
end loop;
if c=a then
dbms_output.put_line('no is perfect'||a);
else
dbms_output.put_line('number is  not perfect:'||a);
end if;
end;
/