Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100001111011111000111 |
3 | 10220100202000111022202011 |
4 | 100002122330033133013 |
5 | 121024110421023421 |
6 | 2202145225555051 |
7 | 142424224606303 |
oct | 20023274173707 |
9 | 3810660438664 |
10 | 1102111111111 |
11 | 395447a9901a |
12 | 15971a945a87 |
13 | 7cc0c28664a |
14 | 3b4b1a06d03 |
15 | 1da05eb04e1 |
hex | 1009af0f7c7 |
1102111111111 has 2 divisors, whose sum is σ = 1102111111112. Its totient is φ = 1102111111110.
The previous prime is 1102111111097. The next prime is 1102111111141. The reversal of 1102111111111 is 1111111112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1102111111111 - 29 = 1102111110599 is a prime.
1102111111111 is a modest number, since divided by 1111111 gives 110211 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 1102111111091 and 1102111111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102111111141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551055555555 + 551055555556.
It is an arithmetic number, because the mean of its divisors is an integer number (551055555556).
Almost surely, 21102111111111 is an apocalyptic number.
1102111111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102111111111 is an equidigital number, since it uses as much as digits as its factorization.
1102111111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 1102111111111 its reverse (1111111112011), we get a palindrome (2213222223122).
The spelling of 1102111111111 in words is "one trillion, one hundred two billion, one hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •