prob342(N, startNum=1)=
{
	\\ broke this up into groups on my server as prob342(floor(5*10^9-1),floor(4.5*10^9))
	\\ took 2 days on 7 cores.
	\\ 0-1m: 284309442750
	\\ 1-2m: 444045905723
	\\ 2-3m: 516795842413
	\\ 3-3.5: 261342761882
	\\ 3.5-4: 300500116684
	\\ 4-4.5: 325695015725
	\\ 4.5-5: 193867498445
	\\ 5-7m : 1555214311145
	\\ 7-7.5: 319651393533
	\\ 7.5-8: 409951265537
	\\ 8-8.5: 255564943110
	\\ 8.5-9: 368097494622
	\\ 9-9.5: 405470621801
	\\ 9.5-10: 302534272275
	\\ answer = 5943040885644
	s = 0;
	for(i=startNum,N,
		nsqr = i^2;
		p = eulerphi(nsqr);
		v1 = p^(1/3);
		if (floor(v1)^3 == p || ceil(v1)^3 == p, s += i);
		if ((i % 1000000) == 0, print("1 million"));
	);
	print (s);
}