Simple Kipper program to get the prime factors of a number

prime-factors.kip

def primeFactors(n: num) -> void {
  while (n % 2 == 0) {
    print("2");
    n /= 2;
  }

  // For all non-even divisors
  for (var i: num = 3; i * i <= n; i += 2) {
    while (n % i == 0) {
      print(f"{i}");
      n /= i;
    }
  }

  // In case the remainder is a prime number > 2
  if (n > 2) {
    print(f"{n}");
  }
}

primeFactors(18);

:D