Base | Representation |
---|---|
bin | 11001011101111110011101… |
… | …111001100010110100000101 |
3 | 112200121011020020022001012012 |
4 | 121131332131321202310011 |
5 | 104140142213403020401 |
6 | 1034121104534304005 |
7 | 32410351336034036 |
oct | 3135763571426405 |
9 | 480534206261165 |
10 | 112011101220101 |
11 | 32765706573a46 |
12 | 106906031b8005 |
13 | 4a667a8710105 |
14 | 1d9351accca8d |
15 | ce39ec0c58bb |
hex | 65df9de62d05 |
112011101220101 has 2 divisors, whose sum is σ = 112011101220102. Its totient is φ = 112011101220100.
The previous prime is 112011101220091. The next prime is 112011101220107. The reversal of 112011101220101 is 101022101110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90688862224900 + 21322238995201 = 9523070^2 + 4617601^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112011101220101 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112011101220107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005550610050 + 56005550610051.
It is an arithmetic number, because the mean of its divisors is an integer number (56005550610051).
Almost surely, 2112011101220101 is an apocalyptic number.
It is an amenable number.
112011101220101 is a deficient number, since it is larger than the sum of its proper divisors (1).
112011101220101 is an equidigital number, since it uses as much as digits as its factorization.
112011101220101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112011101220101 its reverse (101022101110211), we get a palindrome (213033202330312).
The spelling of 112011101220101 in words is "one hundred twelve trillion, eleven billion, one hundred one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •