Base | Representation |
---|---|
bin | 10000000010100001100… |
… | …100000011010010100011 |
3 | 10220101000202112202001122 |
4 | 100002201210003102203 |
5 | 121024322341211321 |
6 | 2202204235122455 |
7 | 142430044126343 |
oct | 20024144032243 |
9 | 3811022482048 |
10 | 1102222210211 |
11 | 3954a4780461 |
12 | 15974bba342b |
13 | 7cc292b5065 |
14 | 3b4c2686d23 |
15 | 1da10b088ab |
hex | 100a19034a3 |
1102222210211 has 2 divisors, whose sum is σ = 1102222210212. Its totient is φ = 1102222210210.
The previous prime is 1102222210169. The next prime is 1102222210231. The reversal of 1102222210211 is 1120122222011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102222210211 - 214 = 1102222193827 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102222210211.
It is not a weakly prime, because it can be changed into another prime (1102222210231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551111105105 + 551111105106.
It is an arithmetic number, because the mean of its divisors is an integer number (551111105106).
Almost surely, 21102222210211 is an apocalyptic number.
1102222210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102222210211 is an equidigital number, since it uses as much as digits as its factorization.
1102222210211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1102222210211 its reverse (1120122222011), we get a palindrome (2222344432222).
The spelling of 1102222210211 in words is "one trillion, one hundred two billion, two hundred twenty-two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •