Base | Representation |
---|---|
bin | 11110101111001001100… |
… | …101100100011000011111 |
3 | 21110220222121122211101021 |
4 | 132233021211210120133 |
5 | 234101302004323403 |
6 | 4254200352225011 |
7 | 305413362235024 |
oct | 36571145443037 |
9 | 7426877584337 |
10 | 2112211011103 |
11 | 7448690612a6 |
12 | 2a143b23b167 |
13 | 124246b4976b |
14 | 7433557954b |
15 | 39e242698bd |
hex | 1ebc996461f |
2112211011103 has 2 divisors, whose sum is σ = 2112211011104. Its totient is φ = 2112211011102.
The previous prime is 2112211011101. The next prime is 2112211011107. The reversal of 2112211011103 is 3011101122112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2112211011103 - 21 = 2112211011101 is a prime.
It is a super-2 number, since 2×21122110111032 (a number of 25 digits) contains 22 as substring.
Together with 2112211011101, 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 (2112211011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056105505551 + 1056105505552.
It is an arithmetic number, because the mean of its divisors is an integer number (1056105505552).
Almost surely, 22112211011103 is an apocalyptic number.
2112211011103 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112211011103 is an equidigital number, since it uses as much as digits as its factorization.
2112211011103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 2112211011103 its reverse (3011101122112), we get a palindrome (5123312133215).
The spelling of 2112211011103 in words is "two trillion, one hundred twelve billion, two hundred eleven million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •