Base | Representation |
---|---|
bin | 11001011111011100100011… |
… | …000110000010001110001011 |
3 | 112200221210222102011110101022 |
4 | 121133130203012002032023 |
5 | 104143321110222041021 |
6 | 1034235332535543055 |
7 | 32420555564325635 |
oct | 3137344306021613 |
9 | 480853872143338 |
10 | 112112120112011 |
11 | 327a4535056678 |
12 | 106a80b622aa8b |
13 | 4a73187342976 |
14 | 1d983813b7a55 |
15 | ce64609c41ab |
hex | 65f72318238b |
112112120112011 has 4 divisors (see below), whose sum is σ = 112112830771032. Its totient is φ = 112111409452992.
The previous prime is 112112120111963. The next prime is 112112120112019. The reversal of 112112120112011 is 110211021211211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112112120112011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112112120112019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 355092821 + ... + 355408406.
It is an arithmetic number, because the mean of its divisors is an integer number (28028207692758).
Almost surely, 2112112120112011 is an apocalyptic number.
112112120112011 is a deficient number, since it is larger than the sum of its proper divisors (710659021).
112112120112011 is an equidigital number, since it uses as much as digits as its factorization.
112112120112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710659020.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 112112120112011 its reverse (110211021211211), we get a palindrome (222323141323222).
The spelling of 112112120112011 in words is "one hundred twelve trillion, one hundred twelve billion, one hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •