Base | Representation |
---|---|
bin | 101110101111111001… |
… | …101000000000100001 |
3 | 11210120020011202200021 |
4 | 232233321220000201 |
5 | 1310300103243022 |
6 | 35020513153441 |
7 | 3424616625046 |
oct | 565771500041 |
9 | 153506152607 |
10 | 50195759137 |
11 | 1a319219867 |
12 | 988a55b881 |
13 | 496c4a0934 |
14 | 260272b1cd |
15 | 148bb627c7 |
hex | bafe68021 |
50195759137 has 2 divisors, whose sum is σ = 50195759138. Its totient is φ = 50195759136.
The previous prime is 50195759129. The next prime is 50195759167. The reversal of 50195759137 is 73195759105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 43523973376 + 6671785761 = 208624^2 + 81681^2 .
It is a cyclic number.
It is not a de Polignac number, because 50195759137 - 23 = 50195759129 is a prime.
It is a super-2 number, since 2×501957591372 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50195759167) 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, 25097879568 + 25097879569.
It is an arithmetic number, because the mean of its divisors is an integer number (25097879569).
Almost surely, 250195759137 is an apocalyptic number.
It is an amenable number.
50195759137 is a deficient number, since it is larger than the sum of its proper divisors (1).
50195759137 is an equidigital number, since it uses as much as digits as its factorization.
50195759137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1488375, while the sum is 52.
The spelling of 50195759137 in words is "fifty billion, one hundred ninety-five million, seven hundred fifty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •