Base | Representation |
---|---|
bin | 11001011111011011101101… |
… | …100000111101010010001011 |
3 | 112200221201122202200222221021 |
4 | 121133123231200331102023 |
5 | 104143312240111400021 |
6 | 1034235103425053311 |
7 | 32420524400601145 |
oct | 3137335540752213 |
9 | 480851582628837 |
10 | 112111221200011 |
11 | 327a41136a77a0 |
12 | 106a7aa5187237 |
13 | 4a7307303a587 |
14 | 1d982d7c61c95 |
15 | ce640bb0ec41 |
hex | 65f6ed83d48b |
112111221200011 has 4 divisors (see below), whose sum is σ = 122303150400024. Its totient is φ = 101919292000000.
The previous prime is 112111221200003. The next prime is 112111221200021. The reversal of 112111221200011 is 110002122111211.
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 112111221200011 - 23 = 112111221200003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112111221200021) 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, 5095964599990 + ... + 5095964600011.
It is an arithmetic number, because the mean of its divisors is an integer number (30575787600006).
Almost surely, 2112111221200011 is an apocalyptic number.
112111221200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112111221200011 is a deficient number, since it is larger than the sum of its proper divisors (10191929200013).
112111221200011 is a wasteful number, since it uses less digits than its factorization.
112111221200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10191929200012.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112111221200011 its reverse (110002122111211), we get a palindrome (222113343311222).
The spelling of 112111221200011 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred twenty-one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •