Base | Representation |
---|---|
bin | 100100110101011000010… |
… | …110111010101011110101 |
3 | 22221222111221111101101001 |
4 | 210311120112322223311 |
5 | 312432413320434033 |
6 | 5214454153203301 |
7 | 350605642122502 |
oct | 44653026725365 |
9 | 8858457441331 |
10 | 2531218139893 |
11 | 8965357188a3 |
12 | 34a697a00531 |
13 | 154901250271 |
14 | 8a723c104a9 |
15 | 45c99659e7d |
hex | 24d585baaf5 |
2531218139893 has 2 divisors, whose sum is σ = 2531218139894. Its totient is φ = 2531218139892.
The previous prime is 2531218139839. The next prime is 2531218139927. The reversal of 2531218139893 is 3989318121352.
Together with previous prime (2531218139839) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1369981293444 + 1161236846449 = 1170462^2 + 1077607^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2531218139893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2531218139803) 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, 1265609069946 + 1265609069947.
It is an arithmetic number, because the mean of its divisors is an integer number (1265609069947).
Almost surely, 22531218139893 is an apocalyptic number.
It is an amenable number.
2531218139893 is a deficient number, since it is larger than the sum of its proper divisors (1).
2531218139893 is an equidigital number, since it uses as much as digits as its factorization.
2531218139893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2799360, while the sum is 55.
The spelling of 2531218139893 in words is "two trillion, five hundred thirty-one billion, two hundred eighteen million, one hundred thirty-nine thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •