private void findTriangle(){
		int factorCount = 0;
		int gesucht = 0;
		int factorGoal = 500;
		int searchLimit = 5000000;
//		while (factorCount < 501){
			for(int i = 1; i<searchLimit && factorCount < factorGoal;i++){
				factorCount = divisorCounter(nextTriangle(i));
				if (factorCount > factorGoal){
					gesucht = i;
				}
			}
//		}
		System.out.println(nextTriangle(gesucht));
	}