Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100110110101110010011 |
3 | 10220011120000101002001202 |
4 | 100000203030312232103 |
5 | 121011002130401321 |
6 | 2201214024021415 |
7 | 142323362262230 |
oct | 20004314665623 |
9 | 3804500332052 |
10 | 1100102200211 |
11 | 394607015583 |
12 | 15925a00186b |
13 | 7c97c00c381 |
14 | 3b360cac787 |
15 | 1d93993c70b |
hex | 10023336b93 |
1100102200211 has 8 divisors (see below), whose sum is σ = 1280981538144. Its totient is φ = 925153332480.
The previous prime is 1100102200199. The next prime is 1100102200217. The reversal of 1100102200211 is 1120022010011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100102200211 - 210 = 1100102199187 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100102200192 and 1100102200201.
It is not an unprimeable number, because it can be changed into a prime (1100102200217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1482617150 + ... + 1482617891.
It is an arithmetic number, because the mean of its divisors is an integer number (160122692268).
Almost surely, 21100102200211 is an apocalyptic number.
1100102200211 is a deficient number, since it is larger than the sum of its proper divisors (180879337933).
1100102200211 is an equidigital number, since it uses as much as digits as its factorization.
1100102200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2965235101.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1100102200211 its reverse (1120022010011), we get a palindrome (2220124210222).
The spelling of 1100102200211 in words is "one trillion, one hundred billion, one hundred two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •