Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00011001001101010110001 |
3 | 2122012201002210221210021121 |
4 | 10210222330203021222301 |
5 | 10114004241223223441 |
6 | 110435230042022241 |
7 | 4144026033051004 |
oct | 444527443115261 |
9 | 78181083853247 |
10 | 20112200211121 |
11 | 6454599771347 |
12 | 2309a671a7981 |
13 | b2b7595873c5 |
14 | 4d761573553b |
15 | 24d2701dcdd1 |
hex | 124abc8c9ab1 |
20112200211121 has 8 divisors (see below), whose sum is σ = 20369094627200. Its totient is φ = 19855363535280.
The previous prime is 20112200211113. The next prime is 20112200211149. The reversal of 20112200211121 is 12111200221102.
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 20112200211121 - 23 = 20112200211113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112200211095 and 20112200211104.
It is not an unprimeable number, because it can be changed into a prime (20112200211151) 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, 13733751 + ... + 15127468.
It is an arithmetic number, because the mean of its divisors is an integer number (2546136828400).
Almost surely, 220112200211121 is an apocalyptic number.
It is an amenable number.
20112200211121 is a deficient number, since it is larger than the sum of its proper divisors (256894416079).
20112200211121 is an equidigital number, since it uses as much as digits as its factorization.
20112200211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28870119.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20112200211121 its reverse (12111200221102), we get a palindrome (32223400432223).
The spelling of 20112200211121 in words is "twenty trillion, one hundred twelve billion, two hundred million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •