Base | Representation |
---|---|
bin | 100000000001000110001… |
… | …000111101110101011101 |
3 | 21210100002201111011010001 |
4 | 200001012020331311131 |
5 | 242022002200323401 |
6 | 4402431414014301 |
7 | 314650002343561 |
oct | 40010610756535 |
9 | 7710081434101 |
10 | 2200200011101 |
11 | 779110602314 |
12 | 2b64b6647391 |
13 | 12c62a1428c1 |
14 | 786c13576a1 |
15 | 3c373cae601 |
hex | 2004623dd5d |
2200200011101 has 4 divisors (see below), whose sum is σ = 2236268863804. Its totient is φ = 2164131158400.
The previous prime is 2200200011099. The next prime is 2200200011131. The reversal of 2200200011101 is 1011100020022.
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 623294460100 + 1576905551001 = 789490^2 + 1255749^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200200011101 - 21 = 2200200011099 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 (2200200011131) 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, 18034426260 + ... + 18034426381.
It is an arithmetic number, because the mean of its divisors is an integer number (559067215951).
Almost surely, 22200200011101 is an apocalyptic number.
It is an amenable number.
2200200011101 is a deficient number, since it is larger than the sum of its proper divisors (36068852703).
2200200011101 is an equidigital number, since it uses as much as digits as its factorization.
2200200011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36068852702.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2200200011101 its reverse (1011100020022), we get a palindrome (3211300031123).
The spelling of 2200200011101 in words is "two trillion, two hundred billion, two hundred million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •