Euler 3 - Largest Prime Factor

index.js

'use strict';
function getPrimeFactors(n) {
    
    let primeFactors = [];
    
    while (n % 2 === 0) {
        primeFactors.push(2);
        n = n / 2;
    }
    
    for(var i = 3; i <= Math.sqrt(n); i = i + 2) {
        while (n % i === 0) {
            primeFactors.push(i);
            n = n / i;
        }
    }
    
    if(n > 2) {
        primeFactors.push(n);
    }
    
    console.log(primeFactors.join(' '));
}

getPrimeFactors(600851475143);