Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000000101100100100011 |
3 | 10220011211112012222121102 |
4 | 100000221220011210203 |
5 | 121011212230032321 |
6 | 2201232434345015 |
7 | 142326141500615 |
oct | 20005150054443 |
9 | 3804745188542 |
10 | 1100210002211 |
11 | 394661955841 |
12 | 15928a12b16b |
13 | 7c998455138 |
14 | 3b371330db5 |
15 | 1d944133c0b |
hex | 10029a05923 |
1100210002211 has 8 divisors (see below), whose sum is σ = 1121012588304. Its totient is φ = 1079409042400.
The previous prime is 1100210002207. The next prime is 1100210002217. The reversal of 1100210002211 is 1122000120011.
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 1100210002211 - 22 = 1100210002207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100210002192 and 1100210002201.
It is not an unprimeable number, because it can be changed into a prime (1100210002217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1005161 + ... + 1791861.
It is an arithmetic number, because the mean of its divisors is an integer number (140126573538).
Almost surely, 21100210002211 is an apocalyptic number.
1100210002211 is a deficient number, since it is larger than the sum of its proper divisors (20802586093).
1100210002211 is an equidigital number, since it uses as much as digits as its factorization.
1100210002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813141.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1100210002211 its reverse (1122000120011), we get a palindrome (2222210122222).
The spelling of 1100210002211 in words is "one trillion, one hundred billion, two hundred ten million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •