Base | Representation |
---|---|
bin | 101111000011001101… |
… | …110010010000110111 |
3 | 11211101210221022102211 |
4 | 233003031302100313 |
5 | 1311431032424002 |
6 | 35113010514251 |
7 | 3435633211042 |
oct | 570315622067 |
9 | 154353838384 |
10 | 50519811127 |
11 | 1a475130925 |
12 | 995ab95987 |
13 | 49c1670286 |
14 | 26337a1c59 |
15 | 14aa322dd7 |
hex | bc3372437 |
50519811127 has 2 divisors, whose sum is σ = 50519811128. Its totient is φ = 50519811126.
The previous prime is 50519811091. The next prime is 50519811191. The reversal of 50519811127 is 72111891505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50519811127 - 215 = 50519778359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50519811127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50519814127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25259905563 + 25259905564.
It is an arithmetic number, because the mean of its divisors is an integer number (25259905564).
Almost surely, 250519811127 is an apocalyptic number.
50519811127 is a deficient number, since it is larger than the sum of its proper divisors (1).
50519811127 is an equidigital number, since it uses as much as digits as its factorization.
50519811127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 40.
The spelling of 50519811127 in words is "fifty billion, five hundred nineteen million, eight hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •