Base | Representation |
---|---|
bin | 1000001100100010… |
… | …1101110010101011 |
3 | 12200022212122211121 |
4 | 2003020231302223 |
5 | 14001211200021 |
6 | 1002151440111 |
7 | 105343353514 |
oct | 20310556253 |
9 | 5608778747 |
10 | 2200100011 |
11 | a2999877a |
12 | 514986037 |
13 | 290a68035 |
14 | 16c2a5a0b |
15 | cd23b741 |
hex | 8322dcab |
2200100011 has 4 divisors (see below), whose sum is σ = 2201158312. Its totient is φ = 2199041712.
The previous prime is 2200099991. The next prime is 2200100017. The reversal of 2200100011 is 1100010022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2200100011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2200099967 and 2200100003.
It is not an unprimeable number, because it can be changed into a prime (2200100017) 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, 526026 + ... + 530191.
It is an arithmetic number, because the mean of its divisors is an integer number (550289578).
Almost surely, 22200100011 is an apocalyptic number.
2200100011 is a deficient number, since it is larger than the sum of its proper divisors (1058301).
2200100011 is a wasteful number, since it uses less digits than its factorization.
2200100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1058300.
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 2200100011 is about 46905.2237069604. The cubic root of 2200100011 is about 1300.6111546514.
Adding to 2200100011 its reverse (1100010022), we get a palindrome (3300110033).
It can be divided in two parts, 22001000 and 11, that multiplied together give a triangular number (242011000 = T22000).
The spelling of 2200100011 in words is "two billion, two hundred million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •