Base | Representation |
---|---|
bin | 10010101110101101… |
… | …011010110110000001 |
3 | 1220220120102012222201 |
4 | 102232231122312001 |
5 | 312141404324301 |
6 | 13123332433201 |
7 | 1311240526501 |
oct | 225655326601 |
9 | 56816365881 |
10 | 20111011201 |
11 | 8590161416 |
12 | 3a93178801 |
13 | 1b866a5338 |
14 | d8ad41a01 |
15 | 7ca898201 |
hex | 4aeb5ad81 |
20111011201 has 4 divisors (see below), whose sum is σ = 20199606192. Its totient is φ = 20022416212.
The previous prime is 20111011189. The next prime is 20111011247. The reversal of 20111011201 is 10211011102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10211011102 = 2 ⋅5105505551.
It is a cyclic number.
It is not a de Polignac number, because 20111011201 - 217 = 20110880129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20111011601) 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, 44297155 + ... + 44297608.
It is an arithmetic number, because the mean of its divisors is an integer number (5049901548).
Almost surely, 220111011201 is an apocalyptic number.
It is an amenable number.
20111011201 is a deficient number, since it is larger than the sum of its proper divisors (88594991).
20111011201 is an equidigital number, since it uses as much as digits as its factorization.
20111011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88594990.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20111011201 its reverse (10211011102), we get a palindrome (30322022303).
Subtracting from 20111011201 its reverse (10211011102), we obtain a palindrome (9900000099).
The spelling of 20111011201 in words is "twenty billion, one hundred eleven million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •