Base | Representation |
---|---|
bin | 11111001011000111011… |
… | …110010101101001111101 |
3 | 21120210111102010102000211 |
4 | 133023013132111221331 |
5 | 240044302011114123 |
6 | 4320044232552421 |
7 | 310525466244526 |
oct | 37130736255175 |
9 | 7523442112024 |
10 | 2142240332413 |
11 | 756578901915 |
12 | 2a721bb52711 |
13 | 12702130993c |
14 | 7598385784d |
15 | 3aad073640d |
hex | 1f2c7795a7d |
2142240332413 has 2 divisors, whose sum is σ = 2142240332414. Its totient is φ = 2142240332412.
The previous prime is 2142240332341. The next prime is 2142240332429. The reversal of 2142240332413 is 3142330422412.
Together with previous prime (2142240332341) 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., 1976268016804 + 165972315609 = 1405798^2 + 407397^2 .
It is a cyclic number.
It is not a de Polignac number, because 2142240332413 - 29 = 2142240331901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2142240302413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1071120166206 + 1071120166207.
It is an arithmetic number, because the mean of its divisors is an integer number (1071120166207).
Almost surely, 22142240332413 is an apocalyptic number.
It is an amenable number.
2142240332413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2142240332413 is an equidigital number, since it uses as much as digits as its factorization.
2142240332413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 2142240332413 its reverse (3142330422412), we get a palindrome (5284570754825).
The spelling of 2142240332413 in words is "two trillion, one hundred forty-two billion, two hundred forty million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •