Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …011110100110110011011 |
3 | 10220100202000021210002102 |
4 | 100002122323310312123 |
5 | 121024110404031021 |
6 | 2202145223354015 |
7 | 142424223643235 |
oct | 20023273646633 |
9 | 3810660253072 |
10 | 1102111002011 |
11 | 395447a24058 |
12 | 15971a8b290b |
13 | 7cc0c248aa6 |
14 | 3b4b19b9255 |
15 | 1da05e8d00b |
hex | 1009aef4d9b |
1102111002011 has 2 divisors, whose sum is σ = 1102111002012. Its totient is φ = 1102111002010.
The previous prime is 1102111002007. The next prime is 1102111002023. The reversal of 1102111002011 is 1102001112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1102111002011 - 22 = 1102111002007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102111001983 and 1102111002001.
It is not a weakly prime, because it can be changed into another prime (1102111002211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551055501005 + 551055501006.
It is an arithmetic number, because the mean of its divisors is an integer number (551055501006).
Almost surely, 21102111002011 is an apocalyptic number.
1102111002011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102111002011 is an equidigital number, since it uses as much as digits as its factorization.
1102111002011 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 1102111002011 its reverse (1102001112011), we get a palindrome (2204112114022).
The spelling of 1102111002011 in words is "one trillion, one hundred two billion, one hundred eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •