I want to know if I have 123 (base) ^ (raised to power) 14 digits exponent number, how can i do it? Currently mathematica is supporting only 9 digits in raised to power but i need calculation for raise to power 14. Is there any method or trick available to calculte such big calculation? If it is possible to calculate raise to power by diving the number and then by adding the results generated from divided calculations to generate the final result.
Do you need to know every digit of this very large integer? Just the leading (or trailing) few? The result modulo some other integer(s)?
The first is hopeless, the others can be done in various ways.
The number contains 38971664131288 digits.. which is kinda big.
To give you a better idea, if you were to loop through the digits of this number at a rate of 1 000 000 digits per second, it would take you about 1 year..