1.7 KiB
1.7 KiB
id | challengeType | title |
---|---|---|
5900f4f11000cf542c510003 | 5 | Problem 387: Harshad Numbers |
Description
Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
Find the sum of the strong, right truncatable Harshad primes less than 1014.
Instructions
Tests
tests:
- text: <code>euler387()</code> should return 696067597313468.
testString: assert.strictEqual(euler387(), 696067597313468, '<code>euler387()</code> should return 696067597313468.');
Challenge Seed
function euler387() {
// Good luck!
return true;
}
euler387();
Solution
// solution required