id	title	challengeType	forumTopicId	dashedName
5900f47d1000cf542c50ff8f	Problem 272: Modular Cubes, part 2	5	301922	problem-272-modular-cubes-part-2

--description--

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

For a positive number n, define C(n) as the number of the integers x, for which 1

When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, C(91)=8.

Find the sum of the positive numbers n≤1011 for which C(n)=242.

--hints--

euler272() should return 8495585919506151000.

assert.strictEqual(euler272(), 8495585919506151000);

function euler272() {

  return true;
}

euler272();

// solution required