Base | Representation |
---|---|
bin | 1010000110110100001101… |
… | …1101001100001000101111 |
3 | 1110100022120011112222222222 |
4 | 2201231003131030020233 |
5 | 2424030302300320421 |
6 | 35344514010425555 |
7 | 2224554655362464 |
oct | 241550335141057 |
9 | 43308504488888 |
10 | 11112212120111 |
11 | 35a4732057663 |
12 | 12b57554322bb |
13 | 627b5300716b |
14 | 2a5b9646d66b |
15 | 1440c2ab4cab |
hex | a1b4374c22f |
11112212120111 has 4 divisors (see below), whose sum is σ = 11370635657832. Its totient is φ = 10853788582392.
The previous prime is 11112212120081. The next prime is 11112212120167. The reversal of 11112212120111 is 11102121221111.
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 11112212120111 - 222 = 11112207925807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11112212120111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112212122111) 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, 129211768796 + ... + 129211768881.
It is an arithmetic number, because the mean of its divisors is an integer number (2842658914458).
Almost surely, 211112212120111 is an apocalyptic number.
11112212120111 is a deficient number, since it is larger than the sum of its proper divisors (258423537721).
11112212120111 is an equidigital number, since it uses as much as digits as its factorization.
11112212120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258423537720.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11112212120111 its reverse (11102121221111), we get a palindrome (22214333341222).
The spelling of 11112212120111 in words is "eleven trillion, one hundred twelve billion, two hundred twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •