Base | Representation |
---|---|
bin | 11001011111011100101000… |
… | …100100100100000011110011 |
3 | 112200221211012211001220101121 |
4 | 121133130220210210003303 |
5 | 104143321302233013021 |
6 | 1034235350021243111 |
7 | 32420561061346615 |
oct | 3137345044440363 |
9 | 480854184056347 |
10 | 112112212001011 |
11 | 327a4581a081a2 |
12 | 106a8120b63497 |
13 | 4a731a03a6661 |
14 | 1d9838d696db5 |
15 | ce6468ac5741 |
hex | 65f7289240f3 |
112112212001011 has 4 divisors (see below), whose sum is σ = 113140764404800. Its totient is φ = 111083659597224.
The previous prime is 112112212000981. The next prime is 112112212001017. The reversal of 112112212001011 is 110100212211211.
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 112112212001011 - 27 = 112112212000883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112112212001017) 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, 514276201731 + ... + 514276201948.
It is an arithmetic number, because the mean of its divisors is an integer number (28285191101200).
Almost surely, 2112112212001011 is an apocalyptic number.
112112212001011 is a deficient number, since it is larger than the sum of its proper divisors (1028552403789).
112112212001011 is a wasteful number, since it uses less digits than its factorization.
112112212001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028552403788.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112112212001011 its reverse (110100212211211), we get a palindrome (222212424212222).
The spelling of 112112212001011 in words is "one hundred twelve trillion, one hundred twelve billion, two hundred twelve million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •