Base | Representation |
---|---|
bin | 11001100000101110100101… |
… | …000100111011001011010011 |
3 | 112201021020022212101210012222 |
4 | 121200232211010323023103 |
5 | 104201242002223030021 |
6 | 1034344021014011255 |
7 | 32430124361631662 |
oct | 3140564504731323 |
9 | 481236285353188 |
10 | 112200200205011 |
11 | 32828923a65166 |
12 | 10701198046b2b |
13 | 4a7b5834813a9 |
14 | 1d9c739308dd9 |
15 | ce88b850e6ab |
hex | 660ba513b2d3 |
112200200205011 has 2 divisors, whose sum is σ = 112200200205012. Its totient is φ = 112200200205010.
The previous prime is 112200200205007. The next prime is 112200200205017. The reversal of 112200200205011 is 110502002002211.
It is a weak prime.
It is an emirp because it is prime and its reverse (110502002002211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112200200205011 - 22 = 112200200205007 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (112200200205017) 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 as a sum of consecutive naturals, namely, 56100100102505 + 56100100102506.
It is an arithmetic number, because the mean of its divisors is an integer number (56100100102506).
Almost surely, 2112200200205011 is an apocalyptic number.
112200200205011 is a deficient number, since it is larger than the sum of its proper divisors (1).
112200200205011 is an equidigital number, since it uses as much as digits as its factorization.
112200200205011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 112200200205011 its reverse (110502002002211), we get a palindrome (222702202207222).
The spelling of 112200200205011 in words is "one hundred twelve trillion, two hundred billion, two hundred million, two hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •