Base | Representation |
---|---|
bin | 101111101000010011… |
… | …101011010100010011 |
3 | 11220000011220111110222 |
4 | 233220103223110103 |
5 | 1314214340100111 |
6 | 35254440543255 |
7 | 3460230532616 |
oct | 575023532423 |
9 | 156004814428 |
10 | 51142112531 |
11 | 1a764431104 |
12 | 9ab3481b2b |
13 | 4a90576963 |
14 | 26922b217d |
15 | 14e4c987db |
hex | be84eb513 |
51142112531 has 2 divisors, whose sum is σ = 51142112532. Its totient is φ = 51142112530.
The previous prime is 51142112471. The next prime is 51142112533. The reversal of 51142112531 is 13521124115.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51142112531 is a prime.
It is a super-2 number, since 2×511421125312 (a number of 22 digits) contains 22 as substring.
Together with 51142112533, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51142112531.
It is not a weakly prime, because it can be changed into another prime (51142112533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25571056265 + 25571056266.
It is an arithmetic number, because the mean of its divisors is an integer number (25571056266).
Almost surely, 251142112531 is an apocalyptic number.
51142112531 is a deficient number, since it is larger than the sum of its proper divisors (1).
51142112531 is an equidigital number, since it uses as much as digits as its factorization.
51142112531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1200, while the sum is 26.
Adding to 51142112531 its reverse (13521124115), we get a palindrome (64663236646).
The spelling of 51142112531 in words is "fifty-one billion, one hundred forty-two million, one hundred twelve thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •