Base | Representation |
---|---|
bin | 11110111000010001101… |
… | …101100110011111000011 |
3 | 21111212021121002101221211 |
4 | 132320101231212133003 |
5 | 234231334304323021 |
6 | 4302501032230551 |
7 | 306211260662233 |
oct | 36702155463703 |
9 | 7455247071854 |
10 | 2122011011011 |
11 | 748a37993281 |
12 | 2a331523b457 |
13 | 12514927c888 |
14 | 749c4d19cc3 |
15 | 3a2e97bd3e1 |
hex | 1ee11b667c3 |
2122011011011 has 8 divisors (see below), whose sum is σ = 2124742233600. Its totient is φ = 2119280913480.
The previous prime is 2122011010993. The next prime is 2122011011047. The reversal of 2122011011011 is 1101101102212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2122011011011 - 211 = 2122011008963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2122011010982 and 2122011011000.
It is not an unprimeable number, because it can be changed into a prime (2122011015011) 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 7 ways as a sum of consecutive naturals, for example, 3526530 + ... + 4084168.
It is an arithmetic number, because the mean of its divisors is an integer number (265592779200).
Almost surely, 22122011011011 is an apocalyptic number.
2122011011011 is a deficient number, since it is larger than the sum of its proper divisors (2731222589).
2122011011011 is an equidigital number, since it uses as much as digits as its factorization.
2122011011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562529.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2122011011011 its reverse (1101101102212), we get a palindrome (3223112113223).
The spelling of 2122011011011 in words is "two trillion, one hundred twenty-two billion, eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •