Base | Representation |
---|---|
bin | 11110101110001101111… |
… | …011000001001001110011 |
3 | 21110211101212002020200102 |
4 | 132232031323001021303 |
5 | 234042224230013021 |
6 | 4253513153143015 |
7 | 305346515626166 |
oct | 36561573011163 |
9 | 7424355066612 |
10 | 2111210001011 |
11 | 7443a5008631 |
12 | 2a11bbb5aa6b |
13 | 1241176478b7 |
14 | 7427c647add |
15 | 39db643900b |
hex | 1eb8dec1273 |
2111210001011 has 4 divisors (see below), whose sum is σ = 2111447411232. Its totient is φ = 2110972590792.
The previous prime is 2111210001001. The next prime is 2111210001067. The reversal of 2111210001011 is 1101000121112.
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 2111210001011 - 26 = 2111210000947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2111210000983 and 2111210001001.
It is not an unprimeable number, because it can be changed into a prime (2111210001001) 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, 118691771 + ... + 118709556.
It is an arithmetic number, because the mean of its divisors is an integer number (527861852808).
Almost surely, 22111210001011 is an apocalyptic number.
2111210001011 is a deficient number, since it is larger than the sum of its proper divisors (237410221).
2111210001011 is an equidigital number, since it uses as much as digits as its factorization.
2111210001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237410220.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2111210001011 its reverse (1101000121112), we get a palindrome (3212210122123).
The spelling of 2111210001011 in words is "two trillion, one hundred eleven billion, two hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •