Base | Representation |
---|---|
bin | 10111001111100000110101… |
… | …100011010111111000011111 |
3 | 111101221020120121122211012121 |
4 | 113033200311203113320133 |
5 | 101344242323222010421 |
6 | 1001223422335043411 |
7 | 30350142435442342 |
oct | 2717406543277037 |
9 | 441836517584177 |
10 | 102221120110111 |
11 | 2a630808448512 |
12 | b56b17a370567 |
13 | 4506544476352 |
14 | 1b35758720459 |
15 | bc4014e96d41 |
hex | 5cf8358d7e1f |
102221120110111 has 2 divisors, whose sum is σ = 102221120110112. Its totient is φ = 102221120110110.
The previous prime is 102221120110103. The next prime is 102221120110127. The reversal of 102221120110111 is 111011021122201.
It is an a-pointer prime, because the next prime (102221120110127) can be obtained adding 102221120110111 to its sum of digits (16).
It is a weak prime.
It is an emirp because it is prime and its reverse (111011021122201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102221120110111 - 23 = 102221120110103 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102221120110171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110560055055 + 51110560055056.
It is an arithmetic number, because the mean of its divisors is an integer number (51110560055056).
Almost surely, 2102221120110111 is an apocalyptic number.
102221120110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102221120110111 is an equidigital number, since it uses as much as digits as its factorization.
102221120110111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 102221120110111 its reverse (111011021122201), we get a palindrome (213232141232312).
The spelling of 102221120110111 in words is "one hundred two trillion, two hundred twenty-one billion, one hundred twenty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •