Base | Representation |
---|---|
bin | 11110100100110011111… |
… | …110110001011100011011 |
3 | 21102212100001012222112111 |
4 | 132210303332301130123 |
5 | 233411033420214321 |
6 | 4245123114453151 |
7 | 304541330453503 |
oct | 36446376613433 |
9 | 7385301188474 |
10 | 2101111101211 |
11 | 740092493751 |
12 | 29b261a341b7 |
13 | 123198310645 |
14 | 739a12dca03 |
15 | 399c4a425e1 |
hex | 1e933fb171b |
2101111101211 has 4 divisors (see below), whose sum is σ = 2101227453424. Its totient is φ = 2100994749000.
The previous prime is 2101111101209. The next prime is 2101111101227. The reversal of 2101111101211 is 1121011111012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2101111101211 - 21 = 2101111101209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101111101191 and 2101111101200.
It is not an unprimeable number, because it can be changed into a prime (2101111141211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58149015 + ... + 58185136.
It is an arithmetic number, because the mean of its divisors is an integer number (525306863356).
Almost surely, 22101111101211 is an apocalyptic number.
2101111101211 is a deficient number, since it is larger than the sum of its proper divisors (116352213).
2101111101211 is a wasteful number, since it uses less digits than its factorization.
2101111101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116352212.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 2101111101211 its reverse (1121011111012), we get a palindrome (3222122212223).
It can be divided in two parts, 21011111012 and 11, that multiplied together give a palindrome (231122221132).
The spelling of 2101111101211 in words is "two trillion, one hundred one billion, one hundred eleven million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.297 sec. • engine limits •