Base | Representation |
---|---|
bin | 11110110110011111110… |
… | …111100001101001011011 |
3 | 21111200100111002022011001 |
4 | 132312133313201221123 |
5 | 234213431324310021 |
6 | 4301543322245431 |
7 | 306113036150215 |
oct | 36663767415133 |
9 | 7450314068131 |
10 | 2120101010011 |
11 | 748147827256 |
12 | 2a2a81656877 |
13 | 124c03656b7a |
14 | 748833ab5b5 |
15 | 3a236c87091 |
hex | 1ed9fde1a5b |
2120101010011 has 8 divisors (see below), whose sum is σ = 2134503162000. Its totient is φ = 2105701168800.
The previous prime is 2120101009937. The next prime is 2120101010021. The reversal of 2120101010011 is 1100101010212.
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 2120101010011 - 221 = 2120098912859 is a prime.
It is a super-3 number, since 3×21201010100113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2120101010011.
It is not an unprimeable number, because it can be changed into a prime (2120101010021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1283805 + ... + 2426593.
It is an arithmetic number, because the mean of its divisors is an integer number (266812895250).
Almost surely, 22120101010011 is an apocalyptic number.
2120101010011 is a deficient number, since it is larger than the sum of its proper divisors (14402151989).
2120101010011 is a wasteful number, since it uses less digits than its factorization.
2120101010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1155389.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2120101010011 its reverse (1100101010212), we get a palindrome (3220202020223).
The spelling of 2120101010011 in words is "two trillion, one hundred twenty billion, one hundred one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •