Base | Representation |
---|---|
bin | 101111000101010100… |
… | …101100101111001001 |
3 | 11211111021111010120101 |
4 | 233011110230233021 |
5 | 1312014111143204 |
6 | 35120312525401 |
7 | 3436542631204 |
oct | 570524545711 |
9 | 154437433511 |
10 | 50555177929 |
11 | 1a493097493 |
12 | 996a9b0861 |
13 | 49c8aa3c89 |
14 | 263836a93b |
15 | 14ad4abea4 |
hex | bc552cbc9 |
50555177929 has 2 divisors, whose sum is σ = 50555177930. Its totient is φ = 50555177928.
The previous prime is 50555177891. The next prime is 50555177989. The reversal of 50555177929 is 92977155505.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50466723904 + 88454025 = 224648^2 + 9405^2 .
It is a cyclic number.
It is not a de Polignac number, because 50555177929 - 29 = 50555177417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50555177929.
It is not a weakly prime, because it can be changed into another prime (50555177989) 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, 25277588964 + 25277588965.
It is an arithmetic number, because the mean of its divisors is an integer number (25277588965).
Almost surely, 250555177929 is an apocalyptic number.
It is an amenable number.
50555177929 is a deficient number, since it is larger than the sum of its proper divisors (1).
50555177929 is an equidigital number, since it uses as much as digits as its factorization.
50555177929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4961250, while the sum is 55.
It can be divided in two parts, 50555 and 177929, that added together give a square (228484 = 4782).
The spelling of 50555177929 in words is "fifty billion, five hundred fifty-five million, one hundred seventy-seven thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •