Base | Representation |
---|---|
bin | 1001000110000110111101… |
… | …00101100010000110000110 |
3 | 2121211002100012021112212202 |
4 | 10203003132211202012012 |
5 | 10110144224120023420 |
6 | 110312213544114502 |
7 | 4133013645556541 |
oct | 443033645420606 |
9 | 77732305245782 |
10 | 20001102111110 |
11 | 641146879446a |
12 | 22b0420765a32 |
13 | b211327235a3 |
14 | 4d20b6789858 |
15 | 24a41b9d7575 |
hex | 1230de962186 |
20001102111110 has 8 divisors (see below), whose sum is σ = 36001983800016. Its totient is φ = 8000440844440.
The previous prime is 20001102111103. The next prime is 20001102111227. The reversal of 20001102111110 is 1111120110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20001102111091 and 20001102111100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000055105546 + ... + 1000055105565.
It is an arithmetic number, because the mean of its divisors is an integer number (4500247975002).
Almost surely, 220001102111110 is an apocalyptic number.
20001102111110 is a deficient number, since it is larger than the sum of its proper divisors (16000881688906).
20001102111110 is a wasteful number, since it uses less digits than its factorization.
20001102111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000110211118.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 20001102111110 its reverse (1111120110002), we get a palindrome (21112222221112).
The spelling of 20001102111110 in words is "twenty trillion, one billion, one hundred two million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •