Base | Representation |
---|---|
bin | 101111001000101011… |
… | …010101010000110001 |
3 | 11211122012100200101011 |
4 | 233020223111100301 |
5 | 1312123012131422 |
6 | 35130042510521 |
7 | 3441125110432 |
oct | 571053252061 |
9 | 154565320334 |
10 | 50611442737 |
11 | 1a511927029 |
12 | 9985805441 |
13 | 4a07643a6b |
14 | 2641a15489 |
15 | 14b33c3077 |
hex | bc8ad5431 |
50611442737 has 2 divisors, whose sum is σ = 50611442738. Its totient is φ = 50611442736.
The previous prime is 50611442711. The next prime is 50611442773. The reversal of 50611442737 is 73724411605.
Together with next prime (50611442773) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41895539856 + 8715902881 = 204684^2 + 93359^2 .
It is a cyclic number.
It is not a de Polignac number, because 50611442737 - 227 = 50477225009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50611442737.
It is not a weakly prime, because it can be changed into another prime (50611442537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25305721368 + 25305721369.
It is an arithmetic number, because the mean of its divisors is an integer number (25305721369).
Almost surely, 250611442737 is an apocalyptic number.
It is an amenable number.
50611442737 is a deficient number, since it is larger than the sum of its proper divisors (1).
50611442737 is an equidigital number, since it uses as much as digits as its factorization.
50611442737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 40.
The spelling of 50611442737 in words is "fifty billion, six hundred eleven million, four hundred forty-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •