@@ -0,0 +1,632 @@
+import java.util.Scanner;%0Aclass PrimeFac%0A%7B%0A    public static void main(String%5B%5D args)%0A    %7B%0A        Scanner in = new Scanner( System.in );%0A        int terms = in.nextInt();%0A        for(int q = 0; q%3Cterms; q++)%0A        %7B%0A            int n = in.nextInt();%0A            System.out.println(sumOfDivisors(n));%0A        %7D%0A    %7D%0A    public static long sumOfDivisors(int n)%0A    %7B%0A        long prod=1;%0A        for(int k=2;k*k%3C=n;k++)%7B%0A            int p=1;%0A            while(n%25k==0)%7B%0A                p=p*k+1;%0A                n/=k;%0A            %7D%0A            prod*=p;%0A        %7D%0A        if(n%3E1)%0A            prod*=1+n;%0A        return prod;%0A    %7D%0A%7D%0A

Solve CHEFLCM for April 2015.