How to get decimal form of largest known prime?

[Claudio Grondi]

If  I understand right all your responses
there is no way to get the decimal form
of the prime within let me say minutes?
Any other ideas how to get it similar fast
as the hexadecimal form?

Claudio
P.S. the divmod() approach takes about
four hours on a Pentium 4 2.8 GHz with
400 MHz dual RAM, where on Pentium III
900 MHz with 100 MHz RAM it lasts
twice so long... mhhh... Is Pentium 4
slower than Pentium III running Pythons
divmod()  (compared at same Hz)?

"Claudio Grondi" <claudio.grondi at freenet.de> schrieb im Newsbeitrag
news:2is27mFqeen8U1 at uni-berlin.de...
> According to latest news the largest known prime is:
>                   2**24036583 - 1
> (right?)
>
> Do someone of you know how long would it take on
> a 2.8 GHz Pentium 4 machine to write a  _decimal_  form
> (hexadecimal form can be written in less than one second)
> of this prime to a file and what should be the Python code
> to use for it?
>
> Claudio
> P.S. file.write( '%i' % (2**24036583 - 1,) )
> takes 100% CPU for a long time without any result
> and the critical part is the '%i' % (2**24036583 - 1,)
> conversion.
>
>