Base | Representation |
---|---|
bin | 101111011111001111… |
… | …011101001010010011 |
3 | 11212121120200221102221 |
4 | 233133033131022103 |
5 | 1313411420323102 |
6 | 35231404521511 |
7 | 3453402641164 |
oct | 573717351223 |
9 | 155546627387 |
10 | 50990011027 |
11 | 1a696593a8a |
12 | 9a70550297 |
13 | 4a67bc0377 |
14 | 2679ddb76b |
15 | 14d6751637 |
hex | bdf3dd293 |
50990011027 has 2 divisors, whose sum is σ = 50990011028. Its totient is φ = 50990011026.
The previous prime is 50990011019. The next prime is 50990011129. The reversal of 50990011027 is 72011009905.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50990011027 - 23 = 50990011019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50990010983 and 50990011001.
It is not a weakly prime, because it can be changed into another prime (50990011727) 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, 25495005513 + 25495005514.
It is an arithmetic number, because the mean of its divisors is an integer number (25495005514).
Almost surely, 250990011027 is an apocalyptic number.
50990011027 is a deficient number, since it is larger than the sum of its proper divisors (1).
50990011027 is an equidigital number, since it uses as much as digits as its factorization.
50990011027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 34.
The spelling of 50990011027 in words is "fifty billion, nine hundred ninety million, eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •