Base | Representation |
---|---|
bin | 11001011101110101001010… |
… | …111110100101111100000101 |
3 | 112200120012110122001121120002 |
4 | 121131311022332211330011 |
5 | 104140011243221200401 |
6 | 1034112334304251045 |
7 | 32406546110644601 |
oct | 3135651276457405 |
9 | 480505418047502 |
10 | 112001120100101 |
11 | 32761454484841 |
12 | 1068a698610a85 |
13 | 4a6587790334b |
14 | 1d92c51482501 |
15 | ce3615be6a6b |
hex | 65dd4afa5f05 |
112001120100101 has 2 divisors, whose sum is σ = 112001120100102. Its totient is φ = 112001120100100.
The previous prime is 112001120100083. The next prime is 112001120100127. The reversal of 112001120100101 is 101001021100211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68563450893025 + 43437669207076 = 8280305^2 + 6590726^2 .
It is a cyclic number.
It is not a de Polignac number, because 112001120100101 - 234 = 111983940230917 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 (112001120100901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000560050050 + 56000560050051.
It is an arithmetic number, because the mean of its divisors is an integer number (56000560050051).
Almost surely, 2112001120100101 is an apocalyptic number.
It is an amenable number.
112001120100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
112001120100101 is an equidigital number, since it uses as much as digits as its factorization.
112001120100101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112001120100101 its reverse (101001021100211), we get a palindrome (213002141200312).
The spelling of 112001120100101 in words is "one hundred twelve trillion, one billion, one hundred twenty million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •