Base | Representation |
---|---|
bin | 11011100011110111100100… |
… | …111001000011100000000011 |
3 | 120220011202122111202210012112 |
4 | 123203313210321003200003 |
5 | 111341414401212102321 |
6 | 1105444024200245535 |
7 | 34350200065112333 |
oct | 3343674471034003 |
9 | 526152574683175 |
10 | 121212112222211 |
11 | 3569284a3a10aa |
12 | 117178771708ab |
13 | 528333a1abb6a |
14 | 21d09aa0690c3 |
15 | e0301287ca5b |
hex | 6e3de4e43803 |
121212112222211 has 2 divisors, whose sum is σ = 121212112222212. Its totient is φ = 121212112222210.
The previous prime is 121212112222199. The next prime is 121212112222297. The reversal of 121212112222211 is 112222211212121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121212112222211 - 214 = 121212112205827 is a prime.
It is a super-2 number, since 2×1212121122222112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121212112222811) 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, 60606056111105 + 60606056111106.
It is an arithmetic number, because the mean of its divisors is an integer number (60606056111106).
Almost surely, 2121212112222211 is an apocalyptic number.
121212112222211 is a deficient number, since it is larger than the sum of its proper divisors (1).
121212112222211 is an equidigital number, since it uses as much as digits as its factorization.
121212112222211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 256, while the sum is 23.
Adding to 121212112222211 its reverse (112222211212121), we get a palindrome (233434323434332).
The spelling of 121212112222211 in words is "one hundred twenty-one trillion, two hundred twelve billion, one hundred twelve million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •