Base | Representation |
---|---|
bin | 101110101010110010… |
… | …101100010111000001 |
3 | 11210100020220120220022 |
4 | 232222302230113001 |
5 | 1310111133241443 |
6 | 35004212223225 |
7 | 3422526306233 |
oct | 565262542701 |
9 | 153306816808 |
10 | 50110055873 |
11 | 1a284902719 |
12 | 986590ab15 |
13 | 49577c4647 |
14 | 25d51bc253 |
15 | 1484383e68 |
hex | baacac5c1 |
50110055873 has 2 divisors, whose sum is σ = 50110055874. Its totient is φ = 50110055872.
The previous prime is 50110055857. The next prime is 50110055887. The reversal of 50110055873 is 37855001105.
50110055873 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 can be written as a sum of positive squares in only one way, i.e., 48385481089 + 1724574784 = 219967^2 + 41528^2 .
It is a cyclic number.
It is not a de Polignac number, because 50110055873 - 24 = 50110055857 is a prime.
It is a super-2 number, since 2×501100558732 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50110055813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25055027936 + 25055027937.
It is an arithmetic number, because the mean of its divisors is an integer number (25055027937).
Almost surely, 250110055873 is an apocalyptic number.
It is an amenable number.
50110055873 is a deficient number, since it is larger than the sum of its proper divisors (1).
50110055873 is an equidigital number, since it uses as much as digits as its factorization.
50110055873 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21000, while the sum is 35.
Adding to 50110055873 its reverse (37855001105), we get a palindrome (87965056978).
The spelling of 50110055873 in words is "fifty billion, one hundred ten million, fifty-five thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •