get all prime factors of a number (useful for lcm of many numbers)

divisors.js

const divisors = new Set();

let n = 12379872;
const bound = Math.sqrt(n);
while (n > 1) {
    for (let i=2; i<=bound; i++) {
        if (n % i === 0) {
            divisors.add(i);
            n /= i;
            break;
        }
    }
}
if (n !== 1) divisors.add(n);

console.log(Array.from(divisors));