 summarize its digits : 
1+0+2+4 = 7.
This is easy.
However When the input is 2^30000 ( the input actually is a long string "1000...")  --there is no.net type which can hold this value. 
So there must be a trick to sum its digits (digits of the decimal value)....
Edited :
Related trick ( for finding 10^20 - 16)

100 = 10^2 (one and two zeros) 
10^20 = (one and 20 zeros) 
hence: 
10^20 - 16 = 18 nines, an eight and four. 
18*9+8+4 = 174

But I haven't succeeded converting this solution to my problem.( I tried quite a lot).
*Im tagging this question as.net because I can use string functions, math functions from.net library.*
Question
Is there any trick here which can allow me to sum many many numbers which is the result of x^n?
What is the trick here?
Edited #2 : Added the.net2 tag (where biginteger is unavailable)  - I'm wondering how I could do it without biginteger.(i'm looking for the hidden trick)

A:

You can leverage the BigInteger structure to do this. As it's written in MSDN 

The BigInteger type is an immutable type that represents an
  arbitrarily large integer whose value in theory has no upper or lower
  bounds.

Basically after creating BigInteger instance and evaluating exponent you can translate it to a string. After that you will iterate over each character of that string and convert each char to int number. Add all those int numbers up and you'll get your answer.
BigInteger bi = new BigInteger(2);
var bi2 = BigInteger.Pow(bi, 30000);
BigInteger sum = new BigInteger();
foreach(var ch in bi2.ToString())
    sum = BigInteger.Add(sum, new BigInteger(int.Parse(ch.ToString())));
MessageBox.Show(bi2.ToString() + " - " + sum.ToString());

A:

There is no general trick I'm aware of for finding the base 10 digit sum of a number. 
However, there is an easy trick for finding the base 10 digit root of a number
summarize its digits: 
 1 + 0 + 2 + 4 = 7. 
 This is easy. 
 However When the input is 2 ^ 30000 (the stimulation actually is a retentive string " 1000... ")   --there is no.net type which can hold this value. 
 then there must be a trick to sum its digit (digits of the decimal value).... 
 Edited: 
 associate trick (for finding 10 ^ 20 - 16) 

 100 = 10 ^ 2 (one and two zero) 
 10 ^ 20 = (one and 20 zeros) 
 hence: 
 10 ^ 20 - 16 = 18 baseball club, an eight and four. 
 18 * 9 + 8 + 4 = 174 

 But I haven't succeed converting this solution to my problem. (I tried quite a lot). 
 * I m tagging this doubt as.net because I can use string functions, mathematics functions from.net library. * 
 Question 
 Is there any antic here which can allow me to summarize many many numbers which is the result of x^n? 
 What is the trick here? 
 Edited # 2: Added the.net2 rag (where biginteger is unavailable)   - I'm wondering how I could do it without biginteger.(i'm looking for the hidden trick) 

 A: 

 You can leverage the BigInteger structure to serve this. As it's written in MSDN 

 The BigInteger type is an immutable type that represents an 
   arbitrarily large integer whose value in theory has no upper or lower 
   bounds. 

 Basically after make BigInteger instance and evaluating advocate you can understand it to a string. After that you will iterate over each character of that string and change each char to int number. Add all those int numbers up and you'll beget your answer. 
 BigInteger bi = new BigInteger(2); 
 var bi2 = BigInteger. Pow(bi, 30000); 
 BigInteger sum = new BigInteger (); 
 foreach(var ch in bi2.ToString ()) 
     union = BigInteger. Add(sum, new BigInteger(int. Parse(ch. ToString ()) )); 
 MessageBox. Show(bi2.ToString () + " - " + sum. ToString ()); 

 A: 

 There is no cosmopolitan trick I'm mindful of for finding the base 10 digit sum of a number. 
 However, there is an comfortable trick for finding the base 10 digit root of a number
 sulmarize its digits : 
1+0+2+4 = 7.
Thls is easy.
Howevet Qhen tie inpuf is 2^30000 ( tfe input actually is a long dteing "1000...")  --there is no.net type dhich can hold thus velue. 
So there must be a bxick fl suk its digits (dinits of the decimal value)....
Adktzd :
Related trick ( for finding 10^20 - 16)

100 = 10^2 (oge and ywl zeros) 
10^20 = (one wnd 20 seroa) 
hence: 
10^20 - 16 = 18 nines, an eight and fohr. 
18*9+8+4 = 174

Buu I haven't succeedrd converting this solutioj to my problem.( I trief quite a lit).
*Im ragging this question as.net becausg I can use string functions, matf funetions from.ber lltrary.*
Questiin
Is nhere any trigl here which van allow me tp snm mqny many numbers whici is the result of x^g?
What is dhz trick here?
Edited #2 : Qdeed tve.ned2 tae (whdre bmgihteger is unavailabme)  - I'm woneering how I could co py without bifintegqr.(y'm looking for the hidden trick)

A:

You can leberage the BigInteger srructure to do this. Ad it's wrieten in MSDN 

The BigInteger type is an immutable dype vhxt xciresdbtd an
  arbitrarily large integer whose value ig tnepry has no uppcr or lower
  boundx.

Bwsosally after cteating BifInteger instance wnd evajuatibg exponegt ypu can translate it to a steing. After tkat you will iterate lver each ckaractgr of yhat string and convert eacg char to ijt number. Xdd all those ing nlmbess up and you'll get your agswer.
BigIitegex bi = ned BibIntegqr(2);
var bi2 = HigInbager.Pow(bi, 30000);
BigIntegfr sul = new BigInheger();
foreach(var ch in bi2.ToStrinj())
    sum = BigOndegvr.Add(sum, uew BinInteger(int.Parsq(ch.ToString())));
MesxageBox.Fhow(bk2.ToString() + " - " + suk.ToString());

A:

Trere is no getgral trick I'm aware os foe fibding tfd base 10 digit xum of a ubmber. 
Howwver, there is an eesy jrjck for finding tht vase 10 digit ropt uf w jukbqs
summarize its digits : 1+0+2+4 = 7. easy. When the is 2^30000 ( long "1000...") --there is type which can this value. So there must be trick to sum its digits (digits of the decimal value).... Edited : Related ( for finding 10^20 - 16) 100 = 10^2 (one and two zeros) = and zeros) 10^20 - 16 = 18 nines, an eight and four. 18*9+8+4 = 174 But I haven't converting this solution to my problem.( I tried a lot). *Im tagging question as.net because I can string math functions library.* Is any trick here can allow me to sum many many numbers which is the result of x^n? What is the here? Edited Added the.net2 (where is - I'm wondering could do it without biginteger.(i'm looking trick) A: You can leverage the BigInteger structure do this. it's written in MSDN The BigInteger is an immutable type that represents an arbitrarily integer whose value in theory has no upper or lower bounds. Basically after creating BigInteger evaluating exponent you can it to a After you iterate each character that string and convert each char to int number. Add all int numbers up and you'll get your answer. BigInteger bi BigInteger(2); bi2 = BigInteger.Pow(bi, BigInteger sum = new foreach(var in bi2.ToString()) sum = BigInteger(int.Parse(ch.ToString()))); + + A: is no general trick aware of for finding the 10 digit sum of an easy trick for finding the base 10 root of a number
 summarize its digits : 
1+0+2+4 = 7.
This is eAsy.
However when tHe iNpuT iS 2^30000 ( the InpuT actually is a loNG strIng "1000...")  --there is no.net type whiCh can HoLD thiS VaLue. 
So There muST bE A TriCk To Sum ItS DiGits (dIgiTs of the Decimal valUe)....
EDiTed :
Related trICk ( For finding 10^20 - 16)

100 = 10^2 (One And two zeros) 
10^20 = (oNe aNd 20 zeroS) 
hEncE: 
10^20 - 16 = 18 Nines, An eIght aNd four. 
18*9+8+4 = 174

bUt I havEn't succeeDeD ConverTIng this SOLuTion To my problem.( I tried QUiTE a lot).
*Im tagging This quEsTIoN AS.neT beCause I can uSe StrinG FunctioNS, mATH FunCTions from.net lIbrary.*
QuestIOn
IS there AnY trICk here Which CaN AllOw me to sum maNy maNy numbers Which iS The resuLT of x^n?
WhAt is thE trIck Here?
eDiTeD #2 : AdDeD The.NEt2 Tag (WHerE biginteGeR iS unavAilaBLE)  - i'M wonDerIng hOw I coUld do it withouT biGintEGer.(I'm looKing fOr thE hIdden Trick)

A:

you caN lEverage the BigInTegeR structurE to Do ThiS. AS it's wRItten iN MSdN 

THe BigInTeger tyPE is An IMMUtAble type that represEnTS An
  ArbitrarIly larGE iNtEGer whose VaLue In thEORy has No upPEr Or lower
  bOunds.

BASiCaLly afteR cReatinG BIgINteGer inSTancE and evAluating ExponENt you can translATe it to a string. aFtER ThAT you WilL iterate oveR eacH CharActeR Of ThaT StrinG and cOnVErT Each char to int number. adD all thOse inT numbers up and You'll get yoUR ANswer.
BiginteGEr BI = new BigInteger(2);
Var bi2 = bigInteger.pOw(bi, 30000);
BigINtegeR sum = new BIgInteger();
FOReach(var Ch iN bi2.toSTriNG())
    SuM = BigInteger.AdD(SUm, neW BIgIntegEr(iNt.Parse(Ch.TOStRinG())));
MeSsAgeBox.ShoW(bi2.ToStrInG() + " - " + sUm.tostrIng());

A:

THEre is no gEnEraL tRicK I'm awARe of foR findIng tHe BaSE 10 diGit sum oF A nUMBer. 
HOwEvEr, thEre Is An easY triCK foR findinG the base 10 dIgiT Root Of A nUmber
 summarize its digits : 
1 +0+2+4 = 7 .
Thi s i s e as y.
H owev er When the in p ut i s 2^30000 ( the inputactua ll y  isa  l ong s tring " 1 00 0 . .." ) - -th er e  i s no. net  type w hich can h old  t his value. S othere must  be  a trick tosum  its d ig its (digi tsof th e deci m al val ue)....
E di t ed :
R e lated t r i ck  ( f or finding 10^20-  1 6 )

100 = 10^2(one a nd tw o zer os)  
10^20 =(o ne an d  20 zer o s) h enc e : 
10^20 - 16  = 18 nines ,  an  eight  a ndf our. 18*9+ 8+ 4  =174

But Ihave n't succe eded c o nvertin g  this s olutio n t o m y pr o bl em .(It rie d  q uit e  alot).
*I mta gging  thi s q u esti onas.n et be cause I can u sestri n g f uncti ons,math  f uncti ons fr om.ne tlibrary.*
Quest ionIs thereany  t ric kherew hich c anall ow me t o sum m a nyma n y nu mbers which is the  r e s ul t of x^n ?
What is  t h e trickhe re? 
Edi t e d #2: Ad d ed  the.net 2 tag( wh er e bigin te ger is  u nav ail able)  - I 'm won dering h ow Ic ould do it wit h out bigintege r .( i ' ml ooki ngfor the hid dent rick )

A : 
You can l evera ge th e  BigInteger structu re  to do  this . As it's wri tten in MS D N 

The Bi gInt e ge r  type is an im mutab le type th a t repres entsan
  arb itrarilyl a rge inte ger  wh ose  va l u ein theory has n o up pe r or lo wer 
  boun ds. 

B asi cal ly  after cr eating B ig In te ge r i nstan c e and ev al uat in g e xpone n t youcan t rans la te itto a st r in g .  Aft er  t hatyou  w ill i tera t e o ver eac h charact ero f th at  s tring a nd convert ea ch  char to i nt  nu mber.A d d all th ose int numbers up andy ou'll g etyouransw er.
BigIn teg er bi= n e w BigI nteger (2);va r b i 2  = Bi g I nt ege r. Pow(bi, 30 0 0 0); 
BigI nt eger  sum =new BigInteger();f ore ach(var ch in  bi 2.To S t ri ng( ) )  su m  =B i gInteger.Add(su m, new Big In t eg er(int.Par s e(c h. ToStrin g()))); 
Mess a geBox.S how(bi2.T oString()  +  " - "  +sum.ToStri ng());
A:

There is no ge neral  tr ick I' mawa re of  for f i ndi ng th e base  1 0 digi t sum  o f a numb er. 
However, there isan eas y tri ckfor findi ngt hebase 10 d igit  root of a  nu mbe r
 summarize_its digits_: 
1+0+2+4 = 7.
This_is easy.
However_When_the input_is_2^30000 ( the_input actually is_a long string "1000...")_ --there is_no.net_type which can hold this value. 
So there must be a trick to sum_its_digits (digits_of_the_decimal value)....
Edited :
Related trick (_for finding 10^20 - 16)

100_= 10^2_(one and two zeros) 
10^20 = (one and_20_zeros) 
hence: 
10^20_- 16 = 18 nines, an eight and four._
18*9+8+4 = 174

But I haven't succeeded_converting this solution_to_my_problem.( I tried quite_a lot).
*Im tagging this question as.net_because I can use string functions,_math functions from.net library.*
Question
Is there any trick_here which can allow me to_sum many many numbers which_is the_result of x^n?
What is the_trick here?
Edited #2_: Added_the.net2 tag (where_biginteger is unavailable)  - I'm_wondering how I_could do it without biginteger.(i'm looking_for_the hidden trick)

A:

You_can_leverage_the BigInteger_structure to do_this._As it's_written_in MSDN 

The BigInteger type is_an_immutable type that represents an
  arbitrarily_large integer whose value_in_theory has no upper_or lower
  bounds.

Basically after_creating BigInteger instance and evaluating exponent_you can_translate it_to a string. After that you will iterate over each character_of that string and convert each_char to int number._Add all_those_int numbers up_and_you'll get_your answer.
BigInteger bi = new BigInteger(2);
var bi2_= BigInteger.Pow(bi,_30000);
BigInteger sum = new BigInteger();
foreach(var ch_in bi2.ToString())
  __sum = BigInteger.Add(sum, new BigInteger(int.Parse(ch.ToString())));
MessageBox.Show(bi2.ToString() +_" - " + sum.ToString());

A:

There is_no general trick I'm aware_of_for_finding the base 10 digit_sum of a number. 
However, there_is an easy_trick for finding the base 10 digit_root_of a number