Base | Representation |
---|---|
bin | 11000001000110101011100… |
… | …01001001101111100110011 |
3 | 20221221102002100110002012112 |
4 | 30010122232021031330303 |
5 | 23424131100114332422 |
6 | 304520401323115535 |
7 | 14115625020231224 |
oct | 1404325611157463 |
9 | 227842070402175 |
10 | 53080127495987 |
11 | 15a051791a2529 |
12 | 5b5334b372bab |
13 | 23805859077a7 |
14 | d1714018724b |
15 | 620b08b58ee2 |
hex | 3046ae24df33 |
53080127495987 has 2 divisors, whose sum is σ = 53080127495988. Its totient is φ = 53080127495986.
The previous prime is 53080127495893. The next prime is 53080127496073. The reversal of 53080127495987 is 78959472108035.
53080127495987 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53080127495987 - 224 = 53080110718771 is a prime.
It is a super-2 number, since 2×530801274959872 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (53080127495287) 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, 26540063747993 + 26540063747994.
It is an arithmetic number, because the mean of its divisors is an integer number (26540063747994).
Almost surely, 253080127495987 is an apocalyptic number.
53080127495987 is a deficient number, since it is larger than the sum of its proper divisors (1).
53080127495987 is an equidigital number, since it uses as much as digits as its factorization.
53080127495987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 152409600, while the sum is 68.
The spelling of 53080127495987 in words is "fifty-three trillion, eighty billion, one hundred twenty-seven million, four hundred ninety-five thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •