Making this program more efficient

This program works perfectly and I know it can generate the correct answer but it's too slow.

This is problem number 3 from Project Euler and the question is What is the largest prime factor of the number 600851475143(Try it yourself and you'll see how long it takes)?

The example they give is that the largest prime factors of 13195 is 5, 7, 13 and 29. This means that 29 is the largest prime factor for that number which is what I get.

The way this program works is that it gets all the prime numbers and puts them in an arraylist. After that, it finds all the numbers that are greater than the previous prime factors.

Java Code:

import java.util.Scanner;
import java.util.ArrayList;

public class PrimeFactors 
{       
   static ArrayList<Double> primeList = new ArrayList<>();
   static double range = 0;
   static double maxPrime = 0;
   static double primeTester = 0;
   
   public static void main(String[] args) 
   {
          Scanner input = new Scanner(System.in);
          
          System.out.println("Up to what number would you like me to find prime numbers? ");
          range = input.nextDouble();
          
          addIntegers();
          
          double incrementer = 0;
          double multiple = 2;
          double add = 1;
          
          for (double i = 2; i < Math.sqrt(range); i++) 
          {
                   for (double j = 2; j < range;) 
                   {
                           j = Math.pow(i, 2) + incrementer;
                           
                           if(primeList.contains(j))
                           {
                                   primeList.remove(j);
                           }
                                   
                           incrementer = multiple * add;
                           add++;
                   } 
                   
                   incrementer = 0;
                   multiple = 1+i;
                   add = 1;
          }
          
          printPrimeNumbers();
          
          System.out.println("\nWhat number inside the list would you like me to find the greatest prime factor");
          primeTester = input.nextDouble();
          
          System.out.println(greaterPrime());
          
   }
   
   public static void addIntegers()
   {
           for (double i = 2; i < range; i++) 
           {
           primeList.add(i);
       }
   }
   
   public static void printPrimeNumbers()
   {
           for (Double double1 : primeList) 
           {
                   System.out.println(double1);
           }
   }
   
   public static double greaterPrime()
   {
           double tempVar = 0;
           
           for (int i = 0; i < primeList.size(); i++) 
           {
                   if(primeTester % primeList.get(i) == 0)
                   {
                           tempVar = primeList.get(i);
                   }
                   
                   if(maxPrime < tempVar)
                   {
                           maxPrime = tempVar;
                   }
           }
           
           return maxPrime;
   }
}