Base | Representation |
---|---|
bin | 1001000110010111110000… |
… | …01110000100000101110111 |
3 | 2121211221121210222112000111 |
4 | 10203023320032010011313 |
5 | 10110321212224213421 |
6 | 110320305001523451 |
7 | 4133453323325512 |
oct | 443137016040567 |
9 | 77757553875014 |
10 | 20010122101111 |
11 | 641527729945a |
12 | 22b21194a3587 |
13 | b21c3c38258c |
14 | 4d26d06c5d79 |
15 | 24a798811ee1 |
hex | 1232f8384177 |
20010122101111 has 8 divisors (see below), whose sum is σ = 20113073984304. Its totient is φ = 19907246795520.
The previous prime is 20010122101093. The next prime is 20010122101127. The reversal of 20010122101111 is 11110122101002.
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 a de Polignac number, because none of the positive numbers 2k-20010122101111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010122101091 and 20010122101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010122102111) 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, 18620410 + ... + 19665703.
It is an arithmetic number, because the mean of its divisors is an integer number (2514134248038).
Almost surely, 220010122101111 is an apocalyptic number.
20010122101111 is a deficient number, since it is larger than the sum of its proper divisors (102951883193).
20010122101111 is a wasteful number, since it uses less digits than its factorization.
20010122101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38288801.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20010122101111 its reverse (11110122101002), we get a palindrome (31120244202113).
The spelling of 20010122101111 in words is "twenty trillion, ten billion, one hundred twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •