def largest_prime_factor(num):
  remainder = num
  factor = 2
  while remainder != 1:
    if remainder % factor == 0:
      remainder /= factor
    else:
      factor += 1

  return factor