Base | Representation |
---|---|
bin | 1010000110110011110101… |
… | …1111101011111001101011 |
3 | 1110100022022012101000120122 |
4 | 2201230331133223321223 |
5 | 2424030101200024321 |
6 | 35344500035113455 |
7 | 2224552332332366 |
oct | 241547537537153 |
9 | 43308265330518 |
10 | 11112112111211 |
11 | 35a469065a481 |
12 | 12b5727a4288b |
13 | 627b3838c5b7 |
14 | 2a5b870790dd |
15 | 1440b8e0c8ab |
hex | a1b3d7ebe6b |
11112112111211 has 8 divisors (see below), whose sum is σ = 11168632246464. Its totient is φ = 11055593122560.
The previous prime is 11112112111187. The next prime is 11112112111241. The reversal of 11112112111211 is 11211121121111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11112112111211 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 11112112111211.
It is not an unprimeable number, because it can be changed into a prime (11112112111241) 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, 24642491 + ... + 25089371.
It is an arithmetic number, because the mean of its divisors is an integer number (1396079030808).
Almost surely, 211112112111211 is an apocalyptic number.
11112112111211 is a deficient number, since it is larger than the sum of its proper divisors (56520135253).
11112112111211 is a wasteful number, since it uses less digits than its factorization.
11112112111211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 573301.
The product of its digits is 8, while the sum is 17.
Adding to 11112112111211 its reverse (11211121121111), we get a palindrome (22323233232322).
The spelling of 11112112111211 in words is "eleven trillion, one hundred twelve billion, one hundred twelve million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •