Base | Representation |
---|---|
bin | 11011100011101100011110… |
… | …111111100101100011101011 |
3 | 120220010121220110210110101022 |
4 | 123203230132333211203223 |
5 | 111341221003220024321 |
6 | 1105434334301243055 |
7 | 34346265664616546 |
oct | 3343543677454353 |
9 | 526117813713338 |
10 | 121200202111211 |
11 | 35688798455463 |
12 | 117154b256348b |
13 | 528218c85a8c2 |
14 | 21d019a36985d |
15 | e02a66e65dab |
hex | 6e3b1efe58eb |
121200202111211 has 2 divisors, whose sum is σ = 121200202111212. Its totient is φ = 121200202111210.
The previous prime is 121200202111123. The next prime is 121200202111223. The reversal of 121200202111211 is 112111202002121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121200202111211 - 214 = 121200202094827 is a prime.
It is a super-2 number, since 2×1212002021112112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121200202111211.
It is not a weakly prime, because it can be changed into another prime (121200202111231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600101055605 + 60600101055606.
It is an arithmetic number, because the mean of its divisors is an integer number (60600101055606).
Almost surely, 2121200202111211 is an apocalyptic number.
121200202111211 is a deficient number, since it is larger than the sum of its proper divisors (1).
121200202111211 is an equidigital number, since it uses as much as digits as its factorization.
121200202111211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121200202111211 its reverse (112111202002121), we get a palindrome (233311404113332).
The spelling of 121200202111211 in words is "one hundred twenty-one trillion, two hundred billion, two hundred two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •