Base | Representation |
---|---|
bin | 11001011111011011101100… |
… | …111010000011010010110011 |
3 | 112200221201122001111211112112 |
4 | 121133123230322003102303 |
5 | 104143312230004013021 |
6 | 1034235102422315535 |
7 | 32420524215112355 |
oct | 3137335472032263 |
9 | 480851561454475 |
10 | 112111211001011 |
11 | 327a4108971072 |
12 | 106a7aa1888bab |
13 | 4a73070ba9271 |
14 | 1d982d67690d5 |
15 | ce640ac97d5b |
hex | 65f6ece834b3 |
112111211001011 has 8 divisors (see below), whose sum is σ = 113218337059920. Its totient is φ = 111009198688992.
The previous prime is 112111211000963. The next prime is 112111211001017. The reversal of 112111211001011 is 110100112111211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112111211001011 - 218 = 112111210738867 is a prime.
It is a super-2 number, since 2×1121112110010112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112111211001017) 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, 1278392660 + ... + 1278480353.
It is an arithmetic number, because the mean of its divisors is an integer number (14152292132490).
Almost surely, 2112111211001011 is an apocalyptic number.
112111211001011 is a deficient number, since it is larger than the sum of its proper divisors (1107126058909).
112111211001011 is a wasteful number, since it uses less digits than its factorization.
112111211001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2556873445.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 112111211001011 its reverse (110100112111211), we get a palindrome (222211323112222).
The spelling of 112111211001011 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •