Base | Representation |
---|---|
bin | 101101101110101011110010… |
… | …000101000010110100000011 |
3 | 222101002220101112120201002010 |
4 | 231232223302011002310003 |
5 | 202330123132200323021 |
6 | 1551425202215224003 |
7 | 60235312021310451 |
oct | 5556536205026403 |
9 | 871086345521063 |
10 | 201120200011011 |
11 | 590a0663793616 |
12 | 1a682538078003 |
13 | 882b727001098 |
14 | 37943abb999d1 |
15 | 183b8e8118976 |
hex | b6eaf2142d03 |
201120200011011 has 4 divisors (see below), whose sum is σ = 268160266681352. Its totient is φ = 134080133340672.
The previous prime is 201120200011009. The next prime is 201120200011019. The reversal of 201120200011011 is 110110002021102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201120200011011 - 21 = 201120200011009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201120200011019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33520033335166 + ... + 33520033335171.
It is an arithmetic number, because the mean of its divisors is an integer number (67040066670338).
Almost surely, 2201120200011011 is an apocalyptic number.
201120200011011 is a deficient number, since it is larger than the sum of its proper divisors (67040066670341).
201120200011011 is an equidigital number, since it uses as much as digits as its factorization.
201120200011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67040066670340.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201120200011011 its reverse (110110002021102), we get a palindrome (311230202032113).
The spelling of 201120200011011 in words is "two hundred one trillion, one hundred twenty billion, two hundred million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •