Base | Representation |
---|---|
bin | 10000000000101001001… |
… | …010010111101010101011 |
3 | 10220011210222120012110111 |
4 | 100000221022113222223 |
5 | 121011203231241021 |
6 | 2201231555355151 |
7 | 142326015333640 |
oct | 20005112275253 |
9 | 3804728505414 |
10 | 1100202212011 |
11 | 394658514961 |
12 | 1592875b2ab7 |
13 | 7c996958356 |
14 | 3b3702a3dc7 |
15 | 1d9435e58e1 |
hex | 10029297aab |
1100202212011 has 8 divisors (see below), whose sum is σ = 1258487671520. Its totient is φ = 942195181248.
The previous prime is 1100202211951. The next prime is 1100202212017. The reversal of 1100202212011 is 1102122020011.
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 1100202212011 - 213 = 1100202203819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100202211982 and 1100202212000.
It is not an unprimeable number, because it can be changed into a prime (1100202212017) 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, 69598716 + ... + 69614521.
It is an arithmetic number, because the mean of its divisors is an integer number (157310958940).
Almost surely, 21100202212011 is an apocalyptic number.
1100202212011 is a deficient number, since it is larger than the sum of its proper divisors (158285459509).
1100202212011 is a wasteful number, since it uses less digits than its factorization.
1100202212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139214373.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1100202212011 its reverse (1102122020011), we get a palindrome (2202324232022).
The spelling of 1100202212011 in words is "one trillion, one hundred billion, two hundred two million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •