[JAVA] Bloodys Mathe-/Optimierungsrunde

public class Calculator
{
	public static void main(String[] args)
	{
		int count = 1;
		while(true)
		{
			CalculatorThread thread = new CalculatorThread(count);
			thread.start();
			count++;
			if(count % 1000 == 0)
			{
				System.out.println("Aktuelle Zahl: "+ count);
			}
		}
	}
}

class CalculatorThread extends Thread implements Runnable
{
	int number = -1;

	public CalculatorThread(int ziffer)
	{
		this.number = ziffer;
	}

	public void run()
	{
		int finalValue = 0;
		int character = 0;
		int tempnumber = number;

		while (tempnumber > 0)
		{
			character = tempnumber % 10;	
			if(character != 0)
			{
				finalValue += (int)Math.pow(character, character);
			}
			tempnumber /= 10;
		}

		if(finalValue == number)
		{
			System.out.println("Es wurde eine Zahl gefunden: " + number);
		} 
		return;
	}
}