JAVASCRIPT

Factors of a number

/*
	JavaScript program for factors of a number by lolman_ks.
    Same logic can be used to build this program in other languages.
*/
/*
	Logic: Divide the number by every number less than half of the number and 
    check for exact divisibility.
    Add to the factors array if exactly divisible.
*/

function factors(number){
  	var factor_array = []; //Create an empty array. 
  	//Run a loop to check divisibility.
	for(let i = 0;i < Math.ceil(number / 2);++i){
    	if(number % i == 0) factor_array.push(i); //Check for exact divisibility.
    }
 	factor_array.push(number); //Add the number itself in the factor array.
  	return factor_array;
}

//Program for perfect number can also be built using the above function.

function perfect_number(number){
	const factor_array = factors(number);
  	var sum = 0;
  	for(let i = 0;i < factor_array.length;++i){
    	sum += factor_array[i];
    }  
  	if(sum == number * 2) return true;
  	else return false;
}

/*
	I hope that my answers are useful to you. Please promote them if they are.
    #lolman_ks.
*/

factors of a number

def factors(num):
    """Get factors for given integer."""
    result = set()
    for i in range(1, int(num ** 0.5) + 1):
        if num % i == 0:
            result.update({i, num // i})
    return result

Number Of Factors

function countFactors(num)
{
var finalEnd = num/2;
var count = 1;

for(var i=1; i<=finalEnd; i++)
{
if(num%i==0)
{
count++;
}

}
return count;

}


console.log(countFactors(24));

all factors, factors of a number, factors

from functools import reduce

def factors(n):    
    return set(reduce(list.__add__, 
                ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))