Base | Representation |
---|---|
bin | 100100110001111010110… |
… | …0000100101011101011001 |
3 | 122220020211200021000112212 |
4 | 1021203311200211131121 |
5 | 1130310120112000212 |
6 | 14430122444044505 |
7 | 1031132424204224 |
oct | 111436540453531 |
9 | 18806750230485 |
10 | 5055000500057 |
11 | 16798a4aa9292 |
12 | 697839533735 |
13 | 2a88b8b09361 |
14 | 1369402685bb |
15 | 8b75b0bae22 |
hex | 498f5825759 |
5055000500057 has 2 divisors, whose sum is σ = 5055000500058. Its totient is φ = 5055000500056.
The previous prime is 5055000499999. The next prime is 5055000500071. The reversal of 5055000500057 is 7500050005505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5030640782281 + 24359717776 = 2242909^2 + 156076^2 .
It is a cyclic number.
It is not a de Polignac number, because 5055000500057 - 26 = 5055000499993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5055000499996 and 5055000500032.
It is not a weakly prime, because it can be changed into another prime (5055000500257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527500250028 + 2527500250029.
It is an arithmetic number, because the mean of its divisors is an integer number (2527500250029).
Almost surely, 25055000500057 is an apocalyptic number.
It is an amenable number.
5055000500057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5055000500057 is an equidigital number, since it uses as much as digits as its factorization.
5055000500057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21875, while the sum is 32.
The spelling of 5055000500057 in words is "five trillion, fifty-five billion, five hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •