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

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

# --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 &lt; n &lt; 10100, that have this property.

# --hints--

`euler168()` should return 59206.

```js
assert.strictEqual(euler168(), 59206);
```

# --seed--

## --seed-contents--

```js
function euler168() {

  return true;
}

euler168();
```

# --solutions--

```js
// solution required
```
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								---
 								id: 5900f4151000cf542c50ff27
 								title: 'Problem 168: Number Rotations'
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								challengeType: 5
-												fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558)


											
										
										
											2019-08-05 09:17:33 -07:00
+								forumTopicId: 301802
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								---
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --description--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								It can be verified that 714285=5×142857.
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								Find the last 5 digits of the sum of all integers n, 10 &lt; n &lt; 10100, that have this property.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --hints--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								`euler168()` should return 59206.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								```js
 								assert.strictEqual(euler168(), 59206);
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --seed--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								## --seed-contents--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
 								```js
 								function euler168() {
-												fix: remove Good luck! comment from challenge seed code (#39575)


											
										
										
											2020-09-15 09:57:40 -07:00
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								  return true;
 								}
 								euler168();
 								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --solutions--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
 								```js
 								// solution required
 								```