Base | Representation |
---|---|
bin | 100000001010010100110… |
… | …100111101001010001111 |
3 | 21211021200101001211112202 |
4 | 200022110310331022033 |
5 | 242202301141200421 |
6 | 4411151025352115 |
7 | 315450405613424 |
oct | 40122464751217 |
9 | 7737611054482 |
10 | 2210110100111 |
11 | 782336596921 |
12 | 2b840149863b |
13 | 13054930c7b4 |
14 | 78d81593d4b |
15 | 3c753d0c10b |
hex | 20294d3d28f |
2210110100111 has 2 divisors, whose sum is σ = 2210110100112. Its totient is φ = 2210110100110.
The previous prime is 2210110100101. The next prime is 2210110100173. The reversal of 2210110100111 is 1110010110122.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2210110100111 is a prime.
It is a super-2 number, since 2×22101101001112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2210110100092 and 2210110100101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2210110100101) 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, 1105055050055 + 1105055050056.
It is an arithmetic number, because the mean of its divisors is an integer number (1105055050056).
Almost surely, 22210110100111 is an apocalyptic number.
2210110100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210110100111 is an equidigital number, since it uses as much as digits as its factorization.
2210110100111 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 2210110100111 its reverse (1110010110122), we get a palindrome (3320120210233).
The spelling of 2210110100111 in words is "two trillion, two hundred ten billion, one hundred ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •