Level
pending

I have sixteen integers arranged in a certain pattern.

The first integer is the sum all the primes numbers which has the property that when divided by six, it doesn't leave a remainder of one or five.

The second integer is five times larger than the answer of this question.

The third integer is larger than the first integer by the fourth integer.

The fourth integer is the only Fibonacci number which is the only known perfect square less than hundred.

The fifth integer is the sum of all known odd perfect numbers less than eight billion then subtracted by twenty.

The sixth integer can be found by drawing a circle and taking the ratio of its circumference to its diameter, then round it down to the lowest integer.

The seventh integer is the product of the first seven non-triangular positive integers then plus the eleventh integer.

The eighth integer has a property that it is impossible for its absolute value to be raised to the power of itself.

The ninth integer is the largest integer smaller than the third integer.

The tenth integer is the Euler totient function of the Euler totient function of twelve raised to the power of twelve.

The eleventh integer is the number of divisors of the sum of the second, fourth, and fifth integer.

The twelveth integer is product of number of prime numbers less than the product of the seventh integer and Ramanujan's number.

The thirteenth integer is one less than the second integer, then multiplied by first integer.

The fourteenth integer is one more than the largest of the first five integers mentioned above.

The fifteenth integer is the smallest of the first integer, seventh integer, thirteenth integer and fourteenth integer, then multiplied by the sum of digits of the sixteenth integer.

The sixteenth integer is the sixteenth smallest positive integer less than nine trillion that is a palindrome.

What is the last three digits of the product of these sixteen integers?

**Details and assumptions**:

- A Fibonacci sequence is defined to a sequence of integers with first two terms equal to one and the subsequent terms equal to the sum of the previous two terms.

- The Euler totient function of an integer is defined to be the number of positive integers less than that integer that does not share any common divisor with it.

- You may use a program to find all the primes numbers for the twelveth number by Sieve of Eratosthenes. Alternatively, List of Primes might come in handy.

- Ramanujan's number is the smallest positive integer that is representable in two ways as a sum of two cubes.

- In mathematics, a number is said to be a palindrome if it remains the same when the digits are reversed.

- A billion is one followed by nine zeros; a trillion is one followed by twelve zeros.

×

Problem Loading...

Note Loading...

Set Loading...