Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …1001011100001000010111 |
3 | 1110022100012121210101010211 |
4 | 2201203202321130020113 |
5 | 2423343400030413421 |
6 | 35340104524430251 |
7 | 2224043651452003 |
oct | 241434271341027 |
9 | 43270177711124 |
10 | 11102002201111 |
11 | 35a03728a5378 |
12 | 12b37860a8387 |
13 | 626bb699b983 |
14 | 2a54a84a5703 |
15 | 143bc658d9e1 |
hex | a18e2e5c217 |
11102002201111 has 4 divisors (see below), whose sum is σ = 11209788630352. Its totient is φ = 10994215771872.
The previous prime is 11102002201097. The next prime is 11102002201141. The reversal of 11102002201111 is 11110220020111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11102002201111 - 217 = 11102002070039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102002201091 and 11102002201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102002201141) 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, 53893214466 + ... + 53893214671.
It is an arithmetic number, because the mean of its divisors is an integer number (2802447157588).
Almost surely, 211102002201111 is an apocalyptic number.
11102002201111 is a deficient number, since it is larger than the sum of its proper divisors (107786429241).
11102002201111 is a wasteful number, since it uses less digits than its factorization.
11102002201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107786429240.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11102002201111 its reverse (11110220020111), we get a palindrome (22212222221222).
The spelling of 11102002201111 in words is "eleven trillion, one hundred two billion, two million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •