Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …001101101000100111101 |
3 | 11020201221202210010221022 |
4 | 101131302021231010331 |
5 | 124131013010202031 |
6 | 2315211435313525 |
7 | 152466230234645 |
oct | 21356211550475 |
9 | 4221852703838 |
10 | 1200211022141 |
11 | 42300891815a |
12 | 1747382ab8a5 |
13 | 89244230b91 |
14 | 4213a579525 |
15 | 213484c097b |
hex | 1177226d13d |
1200211022141 has 2 divisors, whose sum is σ = 1200211022142. Its totient is φ = 1200211022140.
The previous prime is 1200211022117. The next prime is 1200211022203. The reversal of 1200211022141 is 1412201120021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 694298896516 + 505912125625 = 833246^2 + 711275^2 .
It is a cyclic number.
It is not a de Polignac number, because 1200211022141 - 222 = 1200206827837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200211022441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600105511070 + 600105511071.
It is an arithmetic number, because the mean of its divisors is an integer number (600105511071).
Almost surely, 21200211022141 is an apocalyptic number.
It is an amenable number.
1200211022141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200211022141 is an equidigital number, since it uses as much as digits as its factorization.
1200211022141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1200211022141 its reverse (1412201120021), we get a palindrome (2612412142162).
The spelling of 1200211022141 in words is "one trillion, two hundred billion, two hundred eleven million, twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •