C++ (MinGW) How to solve problem with too big integer?

Question

C++ / C#

Hello. In order not to overload too much: I deal with simple RSA and played around with keyless decryption. In general, for a simple example with exponentiation already issue number: 80489967537846372629453297464647461487570571919873235471102321921984841465599982406234587471131313752434026842190466496888662334711842919834043824469411198013600229146154562791676217621730254075007345029660297146908908466965611437999406658217222776330678504099080937405484368280221655073365041331503261471178528929235818166086499630222722639112420284284121.
Swipe see. usigned long long int naturally cannot cope with this and there is nowhere to shove it with an integer. long double is not suitable for division with a remainder.
Question: can someone tell me what to do with this exactly in C ++ (without much fuss with cycles)?
Well, for example: how to create a large enough integer type on MINGW32 to solve this problem?

Answer 1

https://gmplib.org/

Answer 2

boost::multiprecision;

Answer 3

Store it in std::string, obviously