Base | Representation |
---|---|
bin | 10111001111001111001110… |
… | …011011011111000110101111 |
3 | 111101212102202202011210120121 |
4 | 113033033032123133012233 |
5 | 101343440111242320421 |
6 | 1001211014104225411 |
7 | 30345603020253223 |
oct | 2717171633370657 |
9 | 441772682153517 |
10 | 102202210120111 |
11 | 2a623794230102 |
12 | b56758146b267 |
13 | 450481c86225a |
14 | 1b348830d6783 |
15 | bc37a9c8bd41 |
hex | 5cf3ce6df1af |
102202210120111 has 2 divisors, whose sum is σ = 102202210120112. Its totient is φ = 102202210120110.
The previous prime is 102202210120097. The next prime is 102202210120121. The reversal of 102202210120111 is 111021012202201.
It is a strong prime.
It is an emirp because it is prime and its reverse (111021012202201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102202210120111 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102202210120121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101105060055 + 51101105060056.
It is an arithmetic number, because the mean of its divisors is an integer number (51101105060056).
Almost surely, 2102202210120111 is an apocalyptic number.
102202210120111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202210120111 is an equidigital number, since it uses as much as digits as its factorization.
102202210120111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102202210120111 its reverse (111021012202201), we get a palindrome (213223222322312).
The spelling of 102202210120111 in words is "one hundred two trillion, two hundred two billion, two hundred ten million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •