Base | Representation |
---|---|
bin | 10111001111001111001111… |
… | …000101011101000111011011 |
3 | 111101212102210111212202100101 |
4 | 113033033033011131013123 |
5 | 101343440122101401021 |
6 | 1001211015140120231 |
7 | 30345603212624563 |
oct | 2717171705350733 |
9 | 441772714782311 |
10 | 102202221122011 |
11 | 2a62379a464a8a |
12 | b567585096077 |
13 | 4504821c14b5a |
14 | 1b3488475bda3 |
15 | bc37aac11a91 |
hex | 5cf3cf15d1db |
102202221122011 has 2 divisors, whose sum is σ = 102202221122012. Its totient is φ = 102202221122010.
The previous prime is 102202221122003. The next prime is 102202221122063. The reversal of 102202221122011 is 110221122202201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102202221122011 - 23 = 102202221122003 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102202221122011.
It is not a weakly prime, because it can be changed into another prime (102202221126011) 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, 51101110561005 + 51101110561006.
It is an arithmetic number, because the mean of its divisors is an integer number (51101110561006).
Almost surely, 2102202221122011 is an apocalyptic number.
102202221122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202221122011 is an equidigital number, since it uses as much as digits as its factorization.
102202221122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102202221122011 its reverse (110221122202201), we get a palindrome (212423343324212).
The spelling of 102202221122011 in words is "one hundred two trillion, two hundred two billion, two hundred twenty-one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •