// solve with C++// please add comment// please make sure the program will run1)Create a random 2000-digit number. Find the fourteen adjacent digits that have the greatest product. Output the digits that create this number.
For instance, in the number 9845921 the numbers with two adjacent numbers with the greatest product are 9X8 = 72.
2)Create a random 2000-digit number and store it in a file. Read the number from the file and find the smallest number within our larger number
that contains at least every digit. For instance,149485420251367 contains every digit, but 94556780231 is a smaller number that contains every
digit.
3)Find the sum of all the numbers which are equal to the factorial of all their digits (e.g. 145 = 1!+4!+5!)
4)he number 197 is a circular prime because all rotations of the digits 197, 971, and 719 are prime. Find the total of all circular primes that
are three, four, or five digits long. We will only count the lowest of the rotations - in other words only count 197 - not 197, 971, and 719.
// solve with C++ // please make sure the program will run 1) Create a random 2000-digit number. Find the fourteen adjacent digits that have the greatest product. Output the digits that create this number. For instance, in the number 9845921 the numbers with two adjacent numbers with the greatest product are 9X8 = 72. 2) Create a random 2000-digit number and store it in a file. Read the number from the file and find the smallest number within our larger number that contains at least every digit. For instance,149485420251367 contains every digit, but 94556780231 is a smaller number that contains every digit. 3)Find the sum of all the numbers which are equal to the factorial of all their digits (e.g. 145 = 1!+4!+5!) 4) he number 197 is a circular prime because all rotations of the digits 197, 971, and 719 are prime. Find the total of all circular primes that are three, four, or five digits long. We will only count the lowest of the rotations - in other words only count 197 - not 197, 971, and 719.