Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …011111011101010100011 |
3 | 10220011211121010012022202 |
4 | 100000221223323222203 |
5 | 121011213004311321 |
6 | 2201232512123415 |
7 | 142326153166445 |
oct | 20005153735243 |
9 | 3804747105282 |
10 | 1100211010211 |
11 | 3946624840a5 |
12 | 15928a53656b |
13 | 7c998718ba1 |
14 | 3b371514495 |
15 | 1d94428270b |
hex | 10029afbaa3 |
1100211010211 has 8 divisors (see below), whose sum is σ = 1106394901920. Its totient is φ = 1094033170048.
The previous prime is 1100211010187. The next prime is 1100211010229. The reversal of 1100211010211 is 1120101120011.
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 1100211010211 - 218 = 1100210748067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100211010192 and 1100211010201.
It is not an unprimeable number, because it can be changed into a prime (1100211010231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1148006 + ... + 1875723.
It is an arithmetic number, because the mean of its divisors is an integer number (138299362740).
Almost surely, 21100211010211 is an apocalyptic number.
1100211010211 is a deficient number, since it is larger than the sum of its proper divisors (6183891709).
1100211010211 is a wasteful number, since it uses less digits than its factorization.
1100211010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3025773.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1100211010211 its reverse (1120101120011), we get a palindrome (2220312130222).
The spelling of 1100211010211 in words is "one trillion, one hundred billion, two hundred eleven million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •