Base | Representation |
---|---|
bin | 11001100000111000101000… |
… | …110011010101011010110011 |
3 | 112201022021012112100100210212 |
4 | 121200320220303111122303 |
5 | 104201431112012333021 |
6 | 1034353004413414335 |
7 | 32430656121460361 |
oct | 3140705063253263 |
9 | 481267175310725 |
10 | 112211000121011 |
11 | 32832466262980 |
12 | 107032b0a9a3ab |
13 | 4a7c5b4ac242c |
14 | 1d9d0817b4631 |
15 | ce8ceb72985b |
hex | 660e28cd56b3 |
112211000121011 has 32 divisors (see below), whose sum is σ = 127067788627200. Its totient is φ = 98154892823680.
The previous prime is 112211000120987. The next prime is 112211000121083. The reversal of 112211000121011 is 110121000112211.
It is not a de Polignac number, because 112211000121011 - 210 = 112211000119987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112211000121091) 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 31 ways as a sum of consecutive naturals, for example, 110393480 + ... + 111405306.
It is an arithmetic number, because the mean of its divisors is an integer number (3970868394600).
Almost surely, 2112211000121011 is an apocalyptic number.
112211000121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112211000121011 is a deficient number, since it is larger than the sum of its proper divisors (14856788506189).
112211000121011 is a wasteful number, since it uses less digits than its factorization.
112211000121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013059.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112211000121011 its reverse (110121000112211), we get a palindrome (222332000233222).
The spelling of 112211000121011 in words is "one hundred twelve trillion, two hundred eleven billion, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •