10136 - Divisors Sum
Divisors Sum
Time Limit: 1 sec
The Problem
Given an integer number N, you need to calculate the sum of all divisors of N.
For example
If N = 6 then divisors of 6 are 1, 2, 3, 6
So, sum of all divisors of 6 = 1 + 2 + 3 + 6 = 12
The Input
Input begins with an integer T (1 ≤ T ≤ 1000), the number of test cases, followed by T lines, each line containing an integer N (2 ≤ N ≤ 10^12).
The Output
For each test case, you should print a single line containing the sum of all divisors of N.
Sample Input
2
6
9
Sample Output
12
13
[Outsbook Round #2 Online Contest]
Problem Setter: Shahin ShamS