Base | Representation |
---|---|
bin | 101111000111111011… |
… | …100010110001000001 |
3 | 11211121022210012201222 |
4 | 233013323202301001 |
5 | 1312111310241022 |
6 | 35124514204425 |
7 | 3440613453011 |
oct | 570773426101 |
9 | 154538705658 |
10 | 50598915137 |
11 | 1a50584a941 |
12 | 9981583715 |
13 | 4a04b78894 |
14 | 26400b3c41 |
15 | 14b224b242 |
hex | bc7ee2c41 |
50598915137 has 2 divisors, whose sum is σ = 50598915138. Its totient is φ = 50598915136.
The previous prime is 50598915049. The next prime is 50598915149. The reversal of 50598915137 is 73151989505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32578806016 + 18020109121 = 180496^2 + 134239^2 .
It is a cyclic number.
It is not a de Polignac number, because 50598915137 - 232 = 46303947841 is a prime.
It is not a weakly prime, because it can be changed into another prime (50598915337) 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, 25299457568 + 25299457569.
It is an arithmetic number, because the mean of its divisors is an integer number (25299457569).
Almost surely, 250598915137 is an apocalyptic number.
It is an amenable number.
50598915137 is a deficient number, since it is larger than the sum of its proper divisors (1).
50598915137 is an equidigital number, since it uses as much as digits as its factorization.
50598915137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701000, while the sum is 53.
The spelling of 50598915137 in words is "fifty billion, five hundred ninety-eight million, nine hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •