Online Calcualte Politeness of Number

<div id="vueapp">
  positive integer: <input v-model="intn" placeholder="Input positive integer">
  <p>Politeness: {{ politeness }}</p>
</div>

<script src="https://cdn.jsdelivr.net/npm/vue@2.5.16/dist/vue.js"></script>

'use strict';

// Get all prime factors of a given number n
function PrimeFactors(n) {
  if (n==1) {return [1];}

  var pfs = [];
  // Get the number of 2s that divide n
  while (n%2 == 0) {
    pfs.push(2);
    n /= 2;
  }

  // n must be odd at this point. so we can skip one element
  // (note i = i + 2)
  for (var i=3; i*i <= n; i += 2) {
    // while i divides n, append i and divide n
    while (n%i == 0) {
      pfs.push(i);
      n /= i;
    }
  }

  // This condition is to handle the case when n is a prime number
  // greater than 2
  if ( n>2 ) {
    pfs.push(n);
  }

  return pfs;
}

// Algorithm from wiki: An easy way of calculating the politeness of a positive
// number is that of decomposing the number into its prime factors, taking the
// powers of all prime factors greater than 2, adding 1 to all of them,
// multiplying the numbers thus obtained with each other and subtracting 1.
function CalculatePoliteness(n) {
  var pfs = PrimeFactors(n);

  // key: prime
  // value: prime exponent
  var pe = {};
  for (var i=0; i < pfs.length; i++) {
    var prime = pfs[i];
    if (pe.hasOwnProperty(prime)) {
      pe[prime] += 1;
    } else {
      pe[prime] = 1;
    }
  }

  var politeness = 1;
  for (var prime in pe) {
    if (prime > 2) {
      var exponent = pe[prime];
      politeness *= (exponent+1);
    }
  }
  politeness -= 1;

  return politeness;
}

new Vue({
  el: '#vueapp',
  data: {
    intn: 6,
    primes: ""
  },
  watch: {
    intn: {
      immediate: true,
      handler(val, oldVal) {
        var n = parseInt(val);
        if (isNaN(n) || n<1) {
          this.primes = "please input positive integer";
          return;
        }

        this.politeness = CalculatePoliteness(n);
      }
    }
  }
});