Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …1001000011001011001011 |
3 | 1110101011210101102211121222 |
4 | 2201311123321003023023 |
5 | 2424202220233324321 |
6 | 35353003025352255 |
7 | 2225324000241161 |
oct | 241653371031313 |
9 | 43334711384558 |
10 | 11121212011211 |
11 | 35a8530283a95 |
12 | 12b744749868b |
13 | 628958749a03 |
14 | 2a63ab857231 |
15 | 14444cc6e3ab |
hex | a1d5be432cb |
11121212011211 has 2 divisors, whose sum is σ = 11121212011212. Its totient is φ = 11121212011210.
The previous prime is 11121212011177. The next prime is 11121212011213. The reversal of 11121212011211 is 11211021212111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11121212011211 - 210 = 11121212010187 is a prime.
Together with 11121212011213, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121212011211.
It is not a weakly prime, because it can be changed into another prime (11121212011213) 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, 5560606005605 + 5560606005606.
It is an arithmetic number, because the mean of its divisors is an integer number (5560606005606).
Almost surely, 211121212011211 is an apocalyptic number.
11121212011211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121212011211 is an equidigital number, since it uses as much as digits as its factorization.
11121212011211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11121212011211 its reverse (11211021212111), we get a palindrome (22332233223322).
The spelling of 11121212011211 in words is "eleven trillion, one hundred twenty-one billion, two hundred twelve million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •