Base | Representation |
---|---|
bin | 101111000001110111… |
… | …011010111100000001 |
3 | 11211100020100002022001 |
4 | 233001313122330001 |
5 | 1311404233434301 |
6 | 35110441344001 |
7 | 3435236605321 |
oct | 570167327401 |
9 | 154306302261 |
10 | 50497171201 |
11 | 1a463378144 |
12 | 9953498001 |
13 | 49b9a74379 |
14 | 263078b281 |
15 | 14a834ec01 |
hex | bc1ddaf01 |
50497171201 has 2 divisors, whose sum is σ = 50497171202. Its totient is φ = 50497171200.
The previous prime is 50497171157. The next prime is 50497171211. The reversal of 50497171201 is 10217179405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46061744400 + 4435426801 = 214620^2 + 66599^2 .
It is a cyclic number.
It is not a de Polignac number, because 50497171201 - 27 = 50497171073 is a prime.
It is not a weakly prime, because it can be changed into another prime (50497171211) 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, 25248585600 + 25248585601.
It is an arithmetic number, because the mean of its divisors is an integer number (25248585601).
Almost surely, 250497171201 is an apocalyptic number.
It is an amenable number.
50497171201 is a deficient number, since it is larger than the sum of its proper divisors (1).
50497171201 is an equidigital number, since it uses as much as digits as its factorization.
50497171201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 37.
The spelling of 50497171201 in words is "fifty billion, four hundred ninety-seven million, one hundred seventy-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •