Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …00110101100100001000011 |
3 | 20120020021010201122002012122 |
4 | 23120121313212230201003 |
5 | 23030102234202000344 |
6 | 254243112120314455 |
7 | 13354252220401142 |
oct | 1330316746544103 |
9 | 216207121562178 |
10 | 50055555500099 |
11 | 14a49495152636 |
12 | 5745128312a2b |
13 | 21c12ac439366 |
14 | c509b7abb759 |
15 | 5bc0d70d8aee |
hex | 2d86779ac843 |
50055555500099 has 2 divisors, whose sum is σ = 50055555500100. Its totient is φ = 50055555500098.
The previous prime is 50055555500039. The next prime is 50055555500149. The reversal of 50055555500099 is 99000555555005.
50055555500099 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50055555500099 - 28 = 50055555499843 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50055555500099.
It is not a weakly prime, because it can be changed into another prime (50055555500039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027777750049 + 25027777750050.
It is an arithmetic number, because the mean of its divisors is an integer number (25027777750050).
Almost surely, 250055555500099 is an apocalyptic number.
50055555500099 is a deficient number, since it is larger than the sum of its proper divisors (1).
50055555500099 is an equidigital number, since it uses as much as digits as its factorization.
50055555500099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6328125, while the sum is 53.
The spelling of 50055555500099 in words is "fifty trillion, fifty-five billion, five hundred fifty-five million, five hundred thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •