Base | Representation |
---|---|
bin | 101111110011000011… |
… | …110111001000110011 |
3 | 11220110202100221112122 |
4 | 233303003313020303 |
5 | 1320102031003034 |
6 | 35324403344455 |
7 | 3464551121405 |
oct | 576303671063 |
9 | 156422327478 |
10 | 51322516019 |
11 | 1a8472499a5 |
12 | 9b4398212b |
13 | 4abba5c398 |
14 | 26ac232b75 |
15 | 1505a3162e |
hex | bf30f7233 |
51322516019 has 2 divisors, whose sum is σ = 51322516020. Its totient is φ = 51322516018.
The previous prime is 51322516013. The next prime is 51322516051. The reversal of 51322516019 is 91061522315.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51322516019 - 28 = 51322515763 is a prime.
It is a super-2 number, since 2×513225160192 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51322516019.
It is not a weakly prime, because it can be changed into another prime (51322516013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25661258009 + 25661258010.
It is an arithmetic number, because the mean of its divisors is an integer number (25661258010).
Almost surely, 251322516019 is an apocalyptic number.
51322516019 is a deficient number, since it is larger than the sum of its proper divisors (1).
51322516019 is an equidigital number, since it uses as much as digits as its factorization.
51322516019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 35.
The spelling of 51322516019 in words is "fifty-one billion, three hundred twenty-two million, five hundred sixteen thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •