Base | Representation |
---|---|
bin | 10000100111101100111… |
… | …110000011000111111101 |
3 | 11001012001211201022012121 |
4 | 100213230332003013331 |
5 | 122203101324202031 |
6 | 2232405351202541 |
7 | 145342226001601 |
oct | 20475476030775 |
9 | 4035054638177 |
10 | 1142142022141 |
11 | 40041a439a6a |
12 | 165431076451 |
13 | 8391b86c753 |
14 | 3d3cc33d501 |
15 | 1ea9a551011 |
hex | 109ecf831fd |
1142142022141 has 2 divisors, whose sum is σ = 1142142022142. Its totient is φ = 1142142022140.
The previous prime is 1142142022139. The next prime is 1142142022187. The reversal of 1142142022141 is 1412202412411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 957714719641 + 184427302500 = 978629^2 + 429450^2 .
It is a cyclic number.
It is not a de Polignac number, because 1142142022141 - 21 = 1142142022139 is a prime.
Together with 1142142022139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1142142022121) 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, 571071011070 + 571071011071.
It is an arithmetic number, because the mean of its divisors is an integer number (571071011071).
Almost surely, 21142142022141 is an apocalyptic number.
It is an amenable number.
1142142022141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142142022141 is an equidigital number, since it uses as much as digits as its factorization.
1142142022141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 1142142022141 its reverse (1412202412411), we get a palindrome (2554344434552).
The spelling of 1142142022141 in words is "one trillion, one hundred forty-two billion, one hundred forty-two million, twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •