freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md

---
id: 5900f4351000cf542c50ff47
title: >-
  Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
challengeType: 5
forumTopicId: 301840
dashedName: >-
  problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
---

# --description--

We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.

For example, 200 = 5223 or 120072949 = 232613.

The first five squbes are 72, 108, 200, 392, and 500.

Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string "200" is 1992008.

Find the 200th prime-proof sqube containing the contiguous sub-string "200".

# --hints--

`euler200()` should return 229161792008.

```js
assert.strictEqual(euler200(), 229161792008);
```

# --seed--

## --seed-contents--

```js
function euler200() {

  return true;
}

euler200();
```

# --solutions--

```js
// solution required
```