Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …10001100111110010100001 |
3 | 20120001102202221200001212221 |
4 | 23113222311101213302201 |
5 | 23023240320420234203 |
6 | 254204000400151041 |
7 | 13350513524425642 |
oct | 1327526521476241 |
9 | 216042687601787 |
10 | 50005050555553 |
11 | 14a2a028456245 |
12 | 5737392308481 |
13 | 21b95c0ba2aa2 |
14 | c4c3862a96c9 |
15 | 5bab2d250abd |
hex | 2d7ab5467ca1 |
50005050555553 has 2 divisors, whose sum is σ = 50005050555554. Its totient is φ = 50005050555552.
The previous prime is 50005050555541. The next prime is 50005050555557. The reversal of 50005050555553 is 35555505050005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49833038799504 + 172011756049 = 7059252^2 + 414743^2 .
It is a cyclic number.
It is not a de Polignac number, because 50005050555553 - 25 = 50005050555521 is a prime.
It is a super-2 number, since 2×500050505555532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50005050555557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25002525277776 + 25002525277777.
It is an arithmetic number, because the mean of its divisors is an integer number (25002525277777).
Almost surely, 250005050555553 is an apocalyptic number.
It is an amenable number.
50005050555553 is a deficient number, since it is larger than the sum of its proper divisors (1).
50005050555553 is an equidigital number, since it uses as much as digits as its factorization.
50005050555553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1171875, while the sum is 43.
The spelling of 50005050555553 in words is "fifty trillion, five billion, fifty million, five hundred fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •