Base | Representation |
---|---|
bin | 101111111110001111… |
… | …100011100101010011 |
3 | 11220221211101202221122 |
4 | 233332033203211103 |
5 | 1320443043143102 |
6 | 35355144512455 |
7 | 3502316614055 |
oct | 577617434523 |
9 | 156854352848 |
10 | 51510131027 |
11 | 1a933142923 |
12 | 9b9677b72b |
13 | 4b1b89b394 |
14 | 26c910d8d5 |
15 | 15172410a2 |
hex | bfe3e3953 |
51510131027 has 2 divisors, whose sum is σ = 51510131028. Its totient is φ = 51510131026.
The previous prime is 51510130993. The next prime is 51510131033. The reversal of 51510131027 is 72013101515.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51510131027 - 26 = 51510130963 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51510130987 and 51510131005.
It is not a weakly prime, because it can be changed into another prime (51510131047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25755065513 + 25755065514.
It is an arithmetic number, because the mean of its divisors is an integer number (25755065514).
Almost surely, 251510131027 is an apocalyptic number.
51510131027 is a deficient number, since it is larger than the sum of its proper divisors (1).
51510131027 is an equidigital number, since it uses as much as digits as its factorization.
51510131027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1050, while the sum is 26.
The spelling of 51510131027 in words is "fifty-one billion, five hundred ten million, one hundred thirty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •