--- id: 5900f3801000cf542c50fe93 challengeType: 5 title: 'Problem 20: Factorial digit sum' videoUrl: '' localeTitle: 'Problema 20: soma do dígito fatorial' --- ## Description
n ! significa n × ( n - 1) × ... × 3 × 2 × 1 Por exemplo, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
e a soma dos dígitos no número 10! é 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Encontre a soma dos dígitos n !
## Instructions
## Tests
```yml tests: - text: sumFactorialDigits(10) deve retornar 27. testString: 'assert.strictEqual(sumFactorialDigits(10), 27, "sumFactorialDigits(10) should return 27.");' - text: sumFactorialDigits(25) deve retornar 72. testString: 'assert.strictEqual(sumFactorialDigits(25), 72, "sumFactorialDigits(25) should return 72.");' - text: sumFactorialDigits(50) deve retornar 216. testString: 'assert.strictEqual(sumFactorialDigits(50), 216, "sumFactorialDigits(50) should return 216.");' - text: sumFactorialDigits(75) deve retornar 432. testString: 'assert.strictEqual(sumFactorialDigits(75), 432, "sumFactorialDigits(75) should return 432.");' - text: sumFactorialDigits(100) deve retornar 648. testString: 'assert.strictEqual(sumFactorialDigits(100), 648, "sumFactorialDigits(100) should return 648.");' ```
## Challenge Seed
```js function sumFactorialDigits(n) { // Good luck! return n; } sumFactorialDigits(100); ```
## Solution
```js // solution required ```