Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …00100010001000110101111 |
3 | 2121212001011000221202000000 |
4 | 10203030302210101012233 |
5 | 10110330213324000421 |
6 | 110320550051035343 |
7 | 4133516510663454 |
oct | 443146244210657 |
9 | 77761130852000 |
10 | 20011101000111 |
11 | 641572990a7a1 |
12 | 22b235129bb53 |
13 | b22067112160 |
14 | 4d27846dd82b |
15 | 24a804726226 |
hex | 1233329111af |
20011101000111 has 28 divisors (see below), whose sum is σ = 32310843900888. Its totient is φ = 12314523686544.
The previous prime is 20011101000103. The next prime is 20011101000139. The reversal of 20011101000111 is 11100010111002.
It is not a de Polignac number, because 20011101000111 - 23 = 20011101000103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20011101000093 and 20011101000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011101000211) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 1055762445 + ... + 1055781398.
It is an arithmetic number, because the mean of its divisors is an integer number (1153958710746).
Almost surely, 220011101000111 is an apocalyptic number.
20011101000111 is a deficient number, since it is larger than the sum of its proper divisors (12299742900777).
20011101000111 is an equidigital number, since it uses as much as digits as its factorization.
20011101000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2111543874 (or 2111543859 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 20011101000111 its reverse (11100010111002), we get a palindrome (31111111111113).
The spelling of 20011101000111 in words is "twenty trillion, eleven billion, one hundred one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •