Base | Representation |
---|---|
bin | 11001011111010001010001… |
… | …010101110100101101010011 |
3 | 112200220122201111220222001102 |
4 | 121133101101111310231103 |
5 | 104143121310320213021 |
6 | 1034230011213455015 |
7 | 32416646530406603 |
oct | 3137212125645523 |
9 | 480818644828042 |
10 | 112100011101011 |
11 | 3279a39090946a |
12 | 106a5896aa146b |
13 | 4a71ca7730cbb |
14 | 1d97953100c03 |
15 | ce5ea28be00b |
hex | 65f451574b53 |
112100011101011 has 8 divisors (see below), whose sum is σ = 112367592615744. Its totient is φ = 111832464256960.
The previous prime is 112100011100981. The next prime is 112100011101217. The reversal of 112100011101011 is 110101110001211.
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 not a de Polignac number, because 112100011101011 - 26 = 112100011100947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112100011100983 and 112100011101001.
It is not an unprimeable number, because it can be changed into a prime (112100011131011) 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, 2187620 + ... + 15132273.
It is an arithmetic number, because the mean of its divisors is an integer number (14045949076968).
Almost surely, 2112100011101011 is an apocalyptic number.
112100011101011 is a deficient number, since it is larger than the sum of its proper divisors (267581514733).
112100011101011 is a wasteful number, since it uses less digits than its factorization.
112100011101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17335341.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 112100011101011 its reverse (110101110001211), we get a palindrome (222201121102222).
The spelling of 112100011101011 in words is "one hundred twelve trillion, one hundred billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •