Base | Representation |
---|---|
bin | 100100011000010110100… |
… | …1101111001010110101001 |
3 | 122201000010121022121011101 |
4 | 1020300231031321112221 |
5 | 1123410201220100212 |
6 | 14345003043401401 |
7 | 1024150103265034 |
oct | 110605515712651 |
9 | 18630117277141 |
10 | 5000100550057 |
11 | 1658592454288 |
12 | 689077683261 |
13 | 2a3679b6b242 |
14 | 134012c7c01b |
15 | 8a0e6484157 |
hex | 48c2d3795a9 |
5000100550057 has 2 divisors, whose sum is σ = 5000100550058. Its totient is φ = 5000100550056.
The previous prime is 5000100550051. The next prime is 5000100550117. The reversal of 5000100550057 is 7500550010005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4740465462121 + 259635087936 = 2177261^2 + 509544^2 .
It is a cyclic number.
It is not a de Polignac number, because 5000100550057 - 239 = 4450344736169 is a prime.
It is not a weakly prime, because it can be changed into another prime (5000100550051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500050275028 + 2500050275029.
It is an arithmetic number, because the mean of its divisors is an integer number (2500050275029).
Almost surely, 25000100550057 is an apocalyptic number.
It is an amenable number.
5000100550057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5000100550057 is an equidigital number, since it uses as much as digits as its factorization.
5000100550057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4375, while the sum is 28.
The spelling of 5000100550057 in words is "five trillion, one hundred million, five hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •