Base | Representation |
---|---|
bin | 10001101000000111110… |
… | …101000111001100110111 |
3 | 11021210121102111102022202 |
4 | 101220013311013030313 |
5 | 124321231402003421 |
6 | 2324245155015115 |
7 | 153341305213202 |
oct | 21500765071467 |
9 | 4253542442282 |
10 | 1211312141111 |
11 | 427795141146 |
12 | 176915b9a49b |
13 | 8a2c30a1427 |
14 | 428b0a4c939 |
15 | 21797d8610b |
hex | 11a07d47337 |
1211312141111 has 2 divisors, whose sum is σ = 1211312141112. Its totient is φ = 1211312141110.
The previous prime is 1211312141071. The next prime is 1211312141159. The reversal of 1211312141111 is 1111412131121.
It is a m-pointer prime, because the next prime (1211312141159) can be obtained adding 1211312141111 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1211312141111 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1211312141161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605656070555 + 605656070556.
It is an arithmetic number, because the mean of its divisors is an integer number (605656070556).
Almost surely, 21211312141111 is an apocalyptic number.
1211312141111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211312141111 is an equidigital number, since it uses as much as digits as its factorization.
1211312141111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 20.
Adding to 1211312141111 its reverse (1111412131121), we get a palindrome (2322724272232).
The spelling of 1211312141111 in words is "one trillion, two hundred eleven billion, three hundred twelve million, one hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •