Base | Representation |
---|---|
bin | 1010001101000110001000… |
… | …0101001011001111110111 |
3 | 1110201122001001211021222010 |
4 | 2203101202011023033313 |
5 | 2432312231111213421 |
6 | 35510235352335303 |
7 | 2235424353160236 |
oct | 243214205131767 |
9 | 43648031737863 |
10 | 11220100101111 |
11 | 3636465aaa620 |
12 | 13126449a4533 |
13 | 635087a98685 |
14 | 2ab0acd58b1d |
15 | 146cd956e076 |
hex | a346214b3f7 |
11220100101111 has 128 divisors (see below), whose sum is σ = 17555023180800. Its totient is φ = 6302914560000.
The previous prime is 11220100101103. The next prime is 11220100101167. The reversal of 11220100101111 is 11110100102211.
11220100101111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11220100101111 - 23 = 11220100101103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220100101211) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6271715205 + ... + 6271716993.
It is an arithmetic number, because the mean of its divisors is an integer number (137148618600).
Almost surely, 211220100101111 is an apocalyptic number.
11220100101111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11220100101111 is a deficient number, since it is larger than the sum of its proper divisors (6334923079689).
11220100101111 is a wasteful number, since it uses less digits than its factorization.
11220100101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3041.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11220100101111 its reverse (11110100102211), we get a palindrome (22330200203322).
The spelling of 11220100101111 in words is "eleven trillion, two hundred twenty billion, one hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •