Base | Representation |
---|---|
bin | 11000001000000000011110… |
… | …00010110010001011000111 |
3 | 20221211200200101022202022202 |
4 | 30010000033002302023013 |
5 | 23423144324214200411 |
6 | 304455335331145115 |
7 | 14113600203156233 |
oct | 1404001702621307 |
9 | 227750611282282 |
10 | 53051688428231 |
11 | 159a4105076a49 |
12 | 5b4993314519b |
13 | 237a9a2a4a04c |
14 | d15a031835c3 |
15 | 61eee20b383b |
hex | 30400f0b22c7 |
53051688428231 has 2 divisors, whose sum is σ = 53051688428232. Its totient is φ = 53051688428230.
The previous prime is 53051688428213. The next prime is 53051688428261. The reversal of 53051688428231 is 13282488615035.
Together with previous prime (53051688428213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53051688428231 is a prime.
It is a super-2 number, since 2×530516884282312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53051688428261) 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, 26525844214115 + 26525844214116.
It is an arithmetic number, because the mean of its divisors is an integer number (26525844214116).
Almost surely, 253051688428231 is an apocalyptic number.
53051688428231 is a deficient number, since it is larger than the sum of its proper divisors (1).
53051688428231 is an equidigital number, since it uses as much as digits as its factorization.
53051688428231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11059200, while the sum is 56.
The spelling of 53051688428231 in words is "fifty-three trillion, fifty-one billion, six hundred eighty-eight million, four hundred twenty-eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •