Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …111001001101110000101 |
3 | 21010021021010120111102102 |
4 | 131101010333021232011 |
5 | 230422420214200401 |
6 | 4135533344521445 |
7 | 265206314533025 |
oct | 35210477115605 |
9 | 7107233514372 |
10 | 2011202100101 |
11 | 705a45176457 |
12 | 28594b620285 |
13 | 11786a2ccb7c |
14 | 6d4b252ba85 |
15 | 374b168d56b |
hex | 1d444fc9b85 |
2011202100101 has 4 divisors (see below), whose sum is σ = 2011234627500. Its totient is φ = 2011169572704.
The previous prime is 2011202100067. The next prime is 2011202100137. The reversal of 2011202100101 is 1010012021102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 436802028100 + 1574400072001 = 660910^2 + 1254751^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011202100101 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 (2011202100191) 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, 16170776 + ... + 16294673.
It is an arithmetic number, because the mean of its divisors is an integer number (502808656875).
Almost surely, 22011202100101 is an apocalyptic number.
It is an amenable number.
2011202100101 is a deficient number, since it is larger than the sum of its proper divisors (32527399).
2011202100101 is an equidigital number, since it uses as much as digits as its factorization.
2011202100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32527398.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011202100101 its reverse (1010012021102), we get a palindrome (3021214121203).
The spelling of 2011202100101 in words is "two trillion, eleven billion, two hundred two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •