Base | Representation |
---|---|
bin | 10001101000001010001… |
… | …010010011110010101101 |
3 | 11021210201011002110120102 |
4 | 101220022022103302231 |
5 | 124321321410032031 |
6 | 2324253113200445 |
7 | 153342261516422 |
oct | 21501212236255 |
9 | 4253634073512 |
10 | 1211351252141 |
11 | 427805224908 |
12 | 176927100125 |
13 | 8a2cb216454 |
14 | 428b5d0dd49 |
15 | 2179b50e7cb |
hex | 11a0a293cad |
1211351252141 has 2 divisors, whose sum is σ = 1211351252142. Its totient is φ = 1211351252140.
The previous prime is 1211351252129. The next prime is 1211351252161. The reversal of 1211351252141 is 1412521531121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1149634284100 + 61716968041 = 1072210^2 + 248429^2 .
It is an emirp because it is prime and its reverse (1412521531121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1211351252141 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 (1211351252161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605675626070 + 605675626071.
It is an arithmetic number, because the mean of its divisors is an integer number (605675626071).
Almost surely, 21211351252141 is an apocalyptic number.
It is an amenable number.
1211351252141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211351252141 is an equidigital number, since it uses as much as digits as its factorization.
1211351252141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2400, while the sum is 29.
Adding to 1211351252141 its reverse (1412521531121), we get a palindrome (2623872783262).
The spelling of 1211351252141 in words is "one trillion, two hundred eleven billion, three hundred fifty-one million, two hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •