Base | Representation |
---|---|
bin | 11001011101111110100011… |
… | …110011001000000110010111 |
3 | 112200121011111010112210121112 |
4 | 121131332203303020012113 |
5 | 104140142414222413421 |
6 | 1034121122432005235 |
7 | 32410353650253311 |
oct | 3135764363100627 |
9 | 480534433483545 |
10 | 112011200201111 |
11 | 32765757429932 |
12 | 1069063039081b |
13 | 4a667c3087b63 |
14 | 1d9352a0d67b1 |
15 | ce3a05b2845b |
hex | 65dfa3cc8197 |
112011200201111 has 4 divisors (see below), whose sum is σ = 116881252383792. Its totient is φ = 107141148018432.
The previous prime is 112011200201081. The next prime is 112011200201113. The reversal of 112011200201111 is 111102002110211.
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 112011200201111 - 226 = 112011133092247 is a prime.
It is a super-3 number, since 3×1120112002011113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011200201113) 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, 2435026091306 + ... + 2435026091351.
It is an arithmetic number, because the mean of its divisors is an integer number (29220313095948).
Almost surely, 2112011200201111 is an apocalyptic number.
112011200201111 is a deficient number, since it is larger than the sum of its proper divisors (4870052182681).
112011200201111 is an equidigital number, since it uses as much as digits as its factorization.
112011200201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4870052182680.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112011200201111 its reverse (111102002110211), we get a palindrome (223113202311322).
The spelling of 112011200201111 in words is "one hundred twelve trillion, eleven billion, two hundred million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •