Base | Representation |
---|---|
bin | 1001001001010100000001… |
… | …11111100011000010100001 |
3 | 2122012121112011210201122022 |
4 | 10210222000333203002201 |
5 | 10114000214430201423 |
6 | 110434542545551225 |
7 | 4143662211065345 |
oct | 444520077430241 |
9 | 78177464721568 |
10 | 20111201022113 |
11 | 6454126751903 |
12 | 2309828645515 |
13 | b2b62a5723c6 |
14 | 4d755cb59625 |
15 | 24d21261bdc8 |
hex | 124a80fe30a1 |
20111201022113 has 8 divisors (see below), whose sum is σ = 20188580510208. Its totient is φ = 20033828436384.
The previous prime is 20111201022109. The next prime is 20111201022173. The reversal of 20111201022113 is 31122010211102.
It is a happy number.
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 20111201022113 - 22 = 20111201022109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20111201022091 and 20111201022100.
It is not an unprimeable number, because it can be changed into a prime (20111201022103) 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, 4151381 + ... + 7579997.
It is an arithmetic number, because the mean of its divisors is an integer number (2523572563776).
Almost surely, 220111201022113 is an apocalyptic number.
It is an amenable number.
20111201022113 is a deficient number, since it is larger than the sum of its proper divisors (77379488095).
20111201022113 is a wasteful number, since it uses less digits than its factorization.
20111201022113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3451183.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 20111201022113 its reverse (31122010211102), we get a palindrome (51233211233215).
The spelling of 20111201022113 in words is "twenty trillion, one hundred eleven billion, two hundred one million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •