Base | Representation |
---|---|
bin | 11110110110011011001… |
… | …010100010111100111011 |
3 | 21111200010222121202200211 |
4 | 132312123022202330323 |
5 | 234213301130010021 |
6 | 4301531423211551 |
7 | 306111060415111 |
oct | 36663312427473 |
9 | 7450128552624 |
10 | 2120022110011 |
11 | 748107237543 |
12 | 2a2a5b146bb7 |
13 | 124bc01c0390 |
14 | 74876b0dab1 |
15 | 3a22ed9e3e1 |
hex | 1ed9b2a2f3b |
2120022110011 has 8 divisors (see below), whose sum is σ = 2285248538720. Its totient is φ = 1955102510592.
The previous prime is 2120022109999. The next prime is 2120022110029. The reversal of 2120022110011 is 1100112200212.
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 2120022110011 - 217 = 2120021978939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2120022109973 and 2120022110000.
It is not an unprimeable number, because it can be changed into a prime (2120022110611) 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, 76692966 + ... + 76720603.
It is an arithmetic number, because the mean of its divisors is an integer number (285656067340).
Almost surely, 22120022110011 is an apocalyptic number.
2120022110011 is a deficient number, since it is larger than the sum of its proper divisors (165226428709).
2120022110011 is a wasteful number, since it uses less digits than its factorization.
2120022110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153414645.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2120022110011 its reverse (1100112200212), we get a palindrome (3220134310223).
The spelling of 2120022110011 in words is "two trillion, one hundred twenty billion, twenty-two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •