---
id: 5900f4931000cf542c50ffa5
challengeType: 5
title: 'Problem 294: Sum of digits - experience #23'
---

## Description
<section id='description'>
For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.
Thus d(42) = 4+2 = 6.


For a positive integer n, define S(n) as the number of positive integers k < 10n with the following properties :
k is divisible by 23 and
d(k) = 23.

You are given that S(9) = 263626 and S(42) = 6377168878570056.


Find S(1112) and give your answer mod 109.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

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

<div id='js-seed'>

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

euler294();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>