Base | Representation |
---|---|
bin | 101111111110000001… |
… | …000001010110000011 |
3 | 11220221120020012021001 |
4 | 233332001001112003 |
5 | 1320441104231041 |
6 | 35354531112431 |
7 | 3502242334333 |
oct | 577601012603 |
9 | 156846205231 |
10 | 51506320771 |
11 | 1a930a80154 |
12 | 9b95442717 |
13 | 4b1ab65ca9 |
14 | 26c87db0c3 |
15 | 1516c3c131 |
hex | bfe041583 |
51506320771 has 2 divisors, whose sum is σ = 51506320772. Its totient is φ = 51506320770.
The previous prime is 51506320711. The next prime is 51506320967. The reversal of 51506320771 is 17702360515.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51506320771 - 217 = 51506189699 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51506320771.
It is not a weakly prime, because it can be changed into another prime (51506320711) 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, 25753160385 + 25753160386.
It is an arithmetic number, because the mean of its divisors is an integer number (25753160386).
Almost surely, 251506320771 is an apocalyptic number.
51506320771 is a deficient number, since it is larger than the sum of its proper divisors (1).
51506320771 is an equidigital number, since it uses as much as digits as its factorization.
51506320771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44100, while the sum is 37.
The spelling of 51506320771 in words is "fifty-one billion, five hundred six million, three hundred twenty thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •