MathDB

Let

N

be a positive integer with

2k

digits. Its chunks are defined by the two numbers formed by the digits from

1

k

and

k+1

2k

(e.g. the chunks of 142856 are 142 and 856). We define the

N

-reverse as the number formed by switching its chunks (e.g. the reverse of 142856 is 856142 and for 1401 it is 114). We call a number cearense is it satisfies the following conditions:
[*] Has an even number of digits [*] Its chunks are relatively prime [*]Divides its reverse
Find the two smallest cearense integer.

Problem Statement