Base | Representation |
---|---|
bin | 10111001111011000011011… |
… | …111111000010101101011011 |
3 | 111101220101022002000210111101 |
4 | 113033120123333002231123 |
5 | 101344120340403034321 |
6 | 1001215331401012231 |
7 | 30346403103240532 |
oct | 2717303377025533 |
9 | 441811262023441 |
10 | 102212101221211 |
11 | 2a6279aa525823 |
12 | b569481a84077 |
13 | 4505737b115b7 |
14 | 1b351409cd319 |
15 | bc3b882d8791 |
hex | 5cf61bfc2b5b |
102212101221211 has 2 divisors, whose sum is σ = 102212101221212. Its totient is φ = 102212101221210.
The previous prime is 102212101221203. The next prime is 102212101221281. The reversal of 102212101221211 is 112122101212201.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (112122101212201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102212101221211 - 23 = 102212101221203 is a prime.
It is not a weakly prime, because it can be changed into another prime (102212101221281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106050610605 + 51106050610606.
It is an arithmetic number, because the mean of its divisors is an integer number (51106050610606).
Almost surely, 2102212101221211 is an apocalyptic number.
102212101221211 is a deficient number, since it is larger than the sum of its proper divisors (1).
102212101221211 is an equidigital number, since it uses as much as digits as its factorization.
102212101221211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 102212101221211 its reverse (112122101212201), we get a palindrome (214334202433412).
The spelling of 102212101221211 in words is "one hundred two trillion, two hundred twelve billion, one hundred one million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •