public static int divisorSum(int tall) {
		teller++;
		list.add(tall);
//		System.out.println(tall);
		if (tall == 0 || tall == 1 || map2.containsKey(tall))
			return 0;
		if (tall > ord) {
//			System.out.println("for stor lol");
			return 0;
		}
		int sum = 1;
		for (int i = 2; i <= Math.sqrt(tall); i++) {
			if (tall % i == 0) {
				sum+=i+tall/i;
			}
		}
		if (sum == ord) {
			if (storsteRekke < teller) {
				storsteRekke = teller;
				System.out.println(teller);
				System.out.println(tall);
			}
			return ord;
		}
		return divisorSum(sum);
	}