N has 3 prime factors. N^2 has 7!! positive divisors. N^3 has 10!!! positive divisors. ___ has 13!!!! positive divisors.
N has precisely 10 positive divisors. N has precisely 15 positive divisors. N has precisely 20 positive divisors. N has precisely __ positive divisors.
The sequence below contains terms that doesn't have any perfect square factors (except 1). 2, 3, 5, 6, 7, 10, 11, 13, 14, 15...
What is the sum of the square-roots of the terms starting from 2 to the largest two-digit term?
We are given a positive integer N. Two of its positive divisors are chosen and the differences between N and these two divisors are 270 and 280 respectively.
Find the number of possible value(s) of N?
See the following table
Number Number of positive divisors 1 1 2*2 3 3*3*3 4 4*4*4*4 9
As n increases, the number of positive divisors of nxnxnxn.....n (n times) increases. Is it true or false?
