Base | Representation |
---|---|
bin | 1001001001100110011110… |
… | …00001100110111111001010 |
3 | 2122020120002001201000002202 |
4 | 10210303033001212333022 |
5 | 10114131003112320020 |
6 | 110443301130000202 |
7 | 4144462422040151 |
oct | 444631701467712 |
9 | 78216061630082 |
10 | 20121100120010 |
11 | 645834650964a |
12 | 230b72b876062 |
13 | b2c547391596 |
14 | 4d7c1b734598 |
15 | 24d5e16e7e75 |
hex | 124ccf066fca |
20121100120010 has 16 divisors (see below), whose sum is σ = 36218973227976. Its totient is φ = 8048219378688.
The previous prime is 20121100120007. The next prime is 20121100120013. The reversal of 20121100120010 is 1002100112102.
It is an interprime number because it is at equal distance from previous prime (20121100120007) and next prime (20121100120013).
It can be written as a sum of positive squares in 4 ways, for example, as 19818015738049 + 303084381961 = 4451743^2 + 550531^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20121100119973 and 20121100120000.
It is not an unprimeable number, because it can be changed into a prime (20121100120013) 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, 27200447 + ... + 27930386.
Almost surely, 220121100120010 is an apocalyptic number.
20121100120010 is a deficient number, since it is larger than the sum of its proper divisors (16097873107966).
20121100120010 is a wasteful number, since it uses less digits than its factorization.
20121100120010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55167337.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20121100120010 its reverse (1002100112102), we get a palindrome (21123200232112).
The spelling of 20121100120010 in words is "twenty trillion, one hundred twenty-one billion, one hundred million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •