Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1110011001001110001111 |
3 | 1102221200211010002021021210 |
4 | 2200011211332121032033 |
5 | 2420220244224200421 |
6 | 35221502402025503 |
7 | 2213543026653243 |
oct | 240054576311617 |
9 | 42850733067253 |
10 | 11001122100111 |
11 | 3561605699380 |
12 | 1298111648293 |
13 | 61a52aa42010 |
14 | 2a06585c8423 |
15 | 14126ee58576 |
hex | a0165f9938f |
11001122100111 has 32 divisors (see below), whose sum is σ = 17233167893760. Its totient is φ = 6154244985600.
The previous prime is 11001122100107. The next prime is 11001122100113. The reversal of 11001122100111 is 11100122110011.
11001122100111 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 11001122100111 - 22 = 11001122100107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001122100113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11415516 + ... + 12341646.
It is an arithmetic number, because the mean of its divisors is an integer number (538536496680).
Almost surely, 211001122100111 is an apocalyptic number.
11001122100111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11001122100111 is a deficient number, since it is larger than the sum of its proper divisors (6232045793649).
11001122100111 is a wasteful number, since it uses less digits than its factorization.
11001122100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 953847.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11001122100111 its reverse (11100122110011), we get a palindrome (22101244210122).
The spelling of 11001122100111 in words is "eleven trillion, one billion, one hundred twenty-two million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •