Base | Representation |
---|---|
bin | 1001001001010100010001… |
… | …10111000101000111011001 |
3 | 2122012121212101011220212102 |
4 | 10210222020313011013121 |
5 | 10114001002223120441 |
6 | 110435004023053145 |
7 | 4143665403050240 |
oct | 444521067050731 |
9 | 78177771156772 |
10 | 20111333020121 |
11 | 6454194208972 |
12 | 23098648a11b5 |
13 | b2b64ba0a435 |
14 | 4d75724b9957 |
15 | 24d21dee269b |
hex | 124a88dc51d9 |
20111333020121 has 8 divisors (see below), whose sum is σ = 23308104265344. Its totient is φ = 16995492692640.
The previous prime is 20111333020099. The next prime is 20111333020127. The reversal of 20111333020121 is 12102033311102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20111333020121 - 226 = 20111265911257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20111333020093 and 20111333020102.
It is not an unprimeable number, because it can be changed into a prime (20111333020127) 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, 20232728900 + ... + 20232729893.
It is an arithmetic number, because the mean of its divisors is an integer number (2913513033168).
Almost surely, 220111333020121 is an apocalyptic number.
It is an amenable number.
20111333020121 is a deficient number, since it is larger than the sum of its proper divisors (3196771245223).
20111333020121 is an equidigital number, since it uses as much as digits as its factorization.
20111333020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40465458871.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20111333020121 its reverse (12102033311102), we get a palindrome (32213366331223).
The spelling of 20111333020121 in words is "twenty trillion, one hundred eleven billion, three hundred thirty-three million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •