Base | Representation |
---|---|
bin | 11110101110001110100… |
… | …010000000100010010111 |
3 | 21110211102120022112101101 |
4 | 132232032202000202113 |
5 | 234042234334101403 |
6 | 4253514200210531 |
7 | 305350001536246 |
oct | 36561642004227 |
9 | 7424376275341 |
10 | 2111220222103 |
11 | 7443aa859913 |
12 | 2a1203469a47 |
13 | 1241197b5c95 |
14 | 7427db4895d |
15 | 39db72a771d |
hex | 1eb8e880897 |
2111220222103 has 2 divisors, whose sum is σ = 2111220222104. Its totient is φ = 2111220222102.
The previous prime is 2111220222101. The next prime is 2111220222121. The reversal of 2111220222103 is 3012220221112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2111220222103 - 21 = 2111220222101 is a prime.
Together with 2111220222101, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111220222101) 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, 1055610111051 + 1055610111052.
It is an arithmetic number, because the mean of its divisors is an integer number (1055610111052).
Almost surely, 22111220222103 is an apocalyptic number.
2111220222103 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111220222103 is an equidigital number, since it uses as much as digits as its factorization.
2111220222103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2111220222103 its reverse (3012220221112), we get a palindrome (5123440443215).
Subtracting 2111220222103 from its reverse (3012220221112), we obtain a palindrome (900999999009).
The spelling of 2111220222103 in words is "two trillion, one hundred eleven billion, two hundred twenty million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •