Base | Representation |
---|---|
bin | 101111000010010101… |
… | …101101001001111001 |
3 | 11211100210021102110201 |
4 | 233002111231021321 |
5 | 1311413302011022 |
6 | 35111323442201 |
7 | 3435364232026 |
oct | 570225551171 |
9 | 154323242421 |
10 | 50505110137 |
11 | 1a4678aa849 |
12 | 9956086361 |
13 | 49bb5c3a71 |
14 | 263185654d |
15 | 14a8dbc127 |
hex | bc256d279 |
50505110137 has 2 divisors, whose sum is σ = 50505110138. Its totient is φ = 50505110136.
The previous prime is 50505110107. The next prime is 50505110141. The reversal of 50505110137 is 73101150505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49898177641 + 606932496 = 223379^2 + 24636^2 .
It is a cyclic number.
It is not a de Polignac number, because 50505110137 - 219 = 50504585849 is a prime.
It is a super-2 number, since 2×505051101372 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50505110107) 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, 25252555068 + 25252555069.
It is an arithmetic number, because the mean of its divisors is an integer number (25252555069).
Almost surely, 250505110137 is an apocalyptic number.
It is an amenable number.
50505110137 is a deficient number, since it is larger than the sum of its proper divisors (1).
50505110137 is an equidigital number, since it uses as much as digits as its factorization.
50505110137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2625, while the sum is 28.
The spelling of 50505110137 in words is "fifty billion, five hundred five million, one hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •