Here in this code, we have someFunc() which takes O(n) time and will be called for a factor of n times. Can anybody explain how many maximum possible factors of a particular number is possible? I checked it online and got to know that O(n*sqrt(n)) times would be the maximum possible time complexity. But how is sqrt(n) the maximum factor possible?

for(int i = 1; i < len; i++) {
    if(n % i == 0 && someFunc()) {
        // do something;
    }
}