freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md

---
id: 5900f4151000cf542c50ff27
challengeType: 5
title: 'Problem 168: Number Rotations'
---

## Description
<section id='description'>
Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
It can be verified that 714285=5×142857.
This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
Find the last 5 digits of the sum of all integers n, 10 < n < 10100, that have this property.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler168()</code> should return 59206.
    testString: assert.strictEqual(euler168(), 59206, '<code>euler168()</code> should return 59206.');

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler168() {
  // Good luck!
  return true;
}

euler168();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>