Base | Representation |
---|---|
bin | 1001001001010100000001… |
… | …11111111010111101101111 |
3 | 2122012121112011222201001212 |
4 | 10210222000333322331233 |
5 | 10114000214441320421 |
6 | 110434542552025035 |
7 | 4143662211654143 |
oct | 444520077727557 |
9 | 78177464881055 |
10 | 20111201120111 |
11 | 64541268094a2 |
12 | 230982869217b |
13 | b2b62a5a7baa |
14 | 4d755cb83223 |
15 | 24d21263ae5b |
hex | 124a80ffaf6f |
20111201120111 has 4 divisors (see below), whose sum is σ = 20112146705400. Its totient is φ = 20110255534824.
The previous prime is 20111201120107. The next prime is 20111201120173. The reversal of 20111201120111 is 11102110211102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20111201120111 - 22 = 20111201120107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111201120611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 472760741 + ... + 472803278.
It is an arithmetic number, because the mean of its divisors is an integer number (5028036676350).
Almost surely, 220111201120111 is an apocalyptic number.
20111201120111 is a deficient number, since it is larger than the sum of its proper divisors (945585289).
20111201120111 is an equidigital number, since it uses as much as digits as its factorization.
20111201120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 945585288.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 20111201120111 its reverse (11102110211102), we get a palindrome (31213311331213).
Subtracting from 20111201120111 its reverse (11102110211102), we obtain a palindrome (9009090909009).
The spelling of 20111201120111 in words is "twenty trillion, one hundred eleven billion, two hundred one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •