Base | Representation |
---|---|
bin | 11110100100111001010… |
… | …110000110000011010011 |
3 | 21102212120022120110001102 |
4 | 132210321112012003103 |
5 | 233411224440213021 |
6 | 4245140051455015 |
7 | 304543502445545 |
oct | 36447126060323 |
9 | 7385508513042 |
10 | 2101201101011 |
11 | 740129274951 |
12 | 29b287bb746b |
13 | 1231b0b6246c |
14 | 739ad249695 |
15 | 399cc8be00b |
hex | 1e9395860d3 |
2101201101011 has 4 divisors (see below), whose sum is σ = 2104044405000. Its totient is φ = 2098357797024.
The previous prime is 2101201100963. The next prime is 2101201101061. The reversal of 2101201101011 is 1101011021012.
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 2101201101011 - 234 = 2084021231827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101201100983 and 2101201101001.
It is not an unprimeable number, because it can be changed into a prime (2101201101061) 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, 1421650886 + ... + 1421652363.
It is an arithmetic number, because the mean of its divisors is an integer number (526011101250).
Almost surely, 22101201101011 is an apocalyptic number.
2101201101011 is a deficient number, since it is larger than the sum of its proper divisors (2843303989).
2101201101011 is an equidigital number, since it uses as much as digits as its factorization.
2101201101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2843303988.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2101201101011 its reverse (1101011021012), we get a palindrome (3202212122023).
It can be divided in two parts, 210120 and 1101011, that added together give a palindrome (1311131).
The spelling of 2101201101011 in words is "two trillion, one hundred one billion, two hundred one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •