Base | Representation |
---|---|
bin | 11110100101101111100… |
… | …001101001111000010011 |
3 | 21102221220200000102122002 |
4 | 132211233201221320103 |
5 | 233420110141213021 |
6 | 4245410202504215 |
7 | 304605151020404 |
oct | 36455741517023 |
9 | 7387820012562 |
10 | 2102110101011 |
11 | 740555394018 |
12 | 29b4a050506b |
13 | 1232c728a49b |
14 | 73a57c699ab |
15 | 39a325c750b |
hex | 1e96f869e13 |
2102110101011 has 4 divisors (see below), whose sum is σ = 2102229767400. Its totient is φ = 2101990434624.
The previous prime is 2102110100989. The next prime is 2102110101053. The reversal of 2102110101011 is 1101010112012.
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 2102110101011 - 218 = 2102109838867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102110100983 and 2102110101001.
It is not an unprimeable number, because it can be changed into a prime (2102110103011) 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 in 3 ways as a sum of consecutive naturals, for example, 59806841 + ... + 59841978.
It is an arithmetic number, because the mean of its divisors is an integer number (525557441850).
Almost surely, 22102110101011 is an apocalyptic number.
2102110101011 is a deficient number, since it is larger than the sum of its proper divisors (119666389).
2102110101011 is a wasteful number, since it uses less digits than its factorization.
2102110101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119666388.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2102110101011 its reverse (1101010112012), we get a palindrome (3203120213023).
The spelling of 2102110101011 in words is "two trillion, one hundred two billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •