Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …011001011011110111111 |
3 | 10220100222021122122222202 |
4 | 100002200103023132333 |
5 | 121024301424310421 |
6 | 2202202200502115 |
7 | 142426366001435 |
oct | 20024023133677 |
9 | 3810867578882 |
10 | 1102201010111 |
11 | 395493810513 |
12 | 159744a7a93b |
13 | 7cc24aa1616 |
14 | 3b4bd928d55 |
15 | 1da0dd1c10b |
hex | 100a04cb7bf |
1102201010111 has 2 divisors, whose sum is σ = 1102201010112. Its totient is φ = 1102201010110.
The previous prime is 1102201010059. The next prime is 1102201010117. The reversal of 1102201010111 is 1110101022011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102201010111 - 210 = 1102201009087 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102201010092 and 1102201010101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102201010117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551100505055 + 551100505056.
It is an arithmetic number, because the mean of its divisors is an integer number (551100505056).
Almost surely, 21102201010111 is an apocalyptic number.
1102201010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102201010111 is an equidigital number, since it uses as much as digits as its factorization.
1102201010111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1102201010111 its reverse (1110101022011), we get a palindrome (2212302032122).
The spelling of 1102201010111 in words is "one trillion, one hundred two billion, two hundred one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •