Base | Representation |
---|---|
bin | 101111101111010001… |
… | …111011100001100001 |
3 | 11220022100000211110002 |
4 | 233233101323201201 |
5 | 1314434312021022 |
6 | 35314220145345 |
7 | 3463151056025 |
oct | 575721734141 |
9 | 156270024402 |
10 | 51259095137 |
11 | 1a814471948 |
12 | 9b26698255 |
13 | 4aab885333 |
14 | 26a3a44385 |
15 | 15001a5092 |
hex | bef47b861 |
51259095137 has 2 divisors, whose sum is σ = 51259095138. Its totient is φ = 51259095136.
The previous prime is 51259095091. The next prime is 51259095161. The reversal of 51259095137 is 73159095215.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33944746081 + 17314349056 = 184241^2 + 131584^2 .
It is a cyclic number.
It is not a de Polignac number, because 51259095137 - 26 = 51259095073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51259095091 and 51259095100.
It is not a weakly prime, because it can be changed into another prime (51259095197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25629547568 + 25629547569.
It is an arithmetic number, because the mean of its divisors is an integer number (25629547569).
Almost surely, 251259095137 is an apocalyptic number.
It is an amenable number.
51259095137 is a deficient number, since it is larger than the sum of its proper divisors (1).
51259095137 is an equidigital number, since it uses as much as digits as its factorization.
51259095137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 425250, while the sum is 47.
The spelling of 51259095137 in words is "fifty-one billion, two hundred fifty-nine million, ninety-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •