Base | Representation |
---|---|
bin | 1010000110001110111111… |
… | …1000101100110011111101 |
3 | 1110022100202210211100110012 |
4 | 2201203233320230303331 |
5 | 2423344321322023401 |
6 | 35340142311153005 |
7 | 2224052235612050 |
oct | 241435770546375 |
9 | 43270683740405 |
10 | 11102220111101 |
11 | 35a0474900379 |
12 | 12b3827075765 |
13 | 626c1cb86cb2 |
14 | 2a54c93caa97 |
15 | 143bda7848bb |
hex | a18efe2ccfd |
11102220111101 has 8 divisors (see below), whose sum is σ = 12696648822144. Its totient is φ = 9509890716720.
The previous prime is 11102220111067. The next prime is 11102220111179. The reversal of 11102220111101 is 10111102220111.
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 11102220111101 - 230 = 11101146369277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102220111701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 524817830 + ... + 524838983.
It is an arithmetic number, because the mean of its divisors is an integer number (1587081102768).
Almost surely, 211102220111101 is an apocalyptic number.
It is an amenable number.
11102220111101 is a deficient number, since it is larger than the sum of its proper divisors (1594428711043).
11102220111101 is a wasteful number, since it uses less digits than its factorization.
11102220111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1049658331.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11102220111101 its reverse (10111102220111), we get a palindrome (21213322331212).
It can be divided in two parts, 11102220111 and 101, that multiplied together give a palindrome (1121324231211).
The spelling of 11102220111101 in words is "eleven trillion, one hundred two billion, two hundred twenty million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •