Base | Representation |
---|---|
bin | 11101101100001001010… |
… | …00011100000000011101 |
3 | 10121112010210011110012021 |
4 | 32312010220130000131 |
5 | 113203212401122031 |
6 | 2100350430340141 |
7 | 133462555454431 |
oct | 16660450340035 |
9 | 3545123143167 |
10 | 1020132442141 |
11 | 3636aa19472a |
12 | 14586035a651 |
13 | 752762356b7 |
14 | 375361669c1 |
15 | 1b808e44511 |
hex | ed84a1c01d |
1020132442141 has 2 divisors, whose sum is σ = 1020132442142. Its totient is φ = 1020132442140.
The previous prime is 1020132442139. The next prime is 1020132442163. The reversal of 1020132442141 is 1412442310201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 970156051225 + 49976390916 = 984965^2 + 223554^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020132442141 - 21 = 1020132442139 is a prime.
Together with 1020132442139, 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 (1020132442171) 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, 510066221070 + 510066221071.
It is an arithmetic number, because the mean of its divisors is an integer number (510066221071).
Almost surely, 21020132442141 is an apocalyptic number.
It is an amenable number.
1020132442141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020132442141 is an equidigital number, since it uses as much as digits as its factorization.
1020132442141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1020132442141 its reverse (1412442310201), we get a palindrome (2432574752342).
The spelling of 1020132442141 in words is "one trillion, twenty billion, one hundred thirty-two million, four hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •