Base | Representation |
---|---|
bin | 1001001001100110011110… |
… | …00001001100011001011110 |
3 | 2122020120002001111110201010 |
4 | 10210303033001030121132 |
5 | 10114131003100323402 |
6 | 110443301123400050 |
7 | 4144462421104506 |
oct | 444631701143136 |
9 | 78216061443633 |
10 | 20121100011102 |
11 | 6458346444842 |
12 | 230b72b823026 |
13 | b2c547353b3c |
14 | 4d7c1b706a06 |
15 | 24d5e16c5a6c |
hex | 124ccf04c65e |
20121100011102 has 8 divisors (see below), whose sum is σ = 40242200022216. Its totient is φ = 6707033337032.
The previous prime is 20121100011037. The next prime is 20121100011109. The reversal of 20121100011102 is 20111000112102.
It is a sphenic number, since it is the product of 3 distinct primes.
20121100011102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121100011109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1676758334253 + ... + 1676758334264.
It is an arithmetic number, because the mean of its divisors is an integer number (5030275002777).
Almost surely, 220121100011102 is an apocalyptic number.
20121100011102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121100011102 is a wasteful number, since it uses less digits than its factorization.
20121100011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3353516668522.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20121100011102 its reverse (20111000112102), we get a palindrome (40232100123204).
It can be divided in two parts, 201211000 and 11102, that added together give a palindrome (201222102).
The spelling of 20121100011102 in words is "twenty trillion, one hundred twenty-one billion, one hundred million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.308 sec. • engine limits •