Base | Representation |
---|---|
bin | 11001011101110101001111… |
… | …110111011001111110010001 |
3 | 112200120012200100100202020102 |
4 | 121131311033313121332101 |
5 | 104140011430214232121 |
6 | 1034112350354022145 |
7 | 32406551124646631 |
oct | 3135651767317621 |
9 | 480505610322212 |
10 | 112001202102161 |
11 | 327614967a3139 |
12 | 1068a6bbb77955 |
13 | 4a6588b8b4a88 |
14 | 1d92c5c30a6c1 |
15 | ce361cee390b |
hex | 65dd4fdd9f91 |
112001202102161 has 2 divisors, whose sum is σ = 112001202102162. Its totient is φ = 112001202102160.
The previous prime is 112001202102149. The next prime is 112001202102227. The reversal of 112001202102161 is 161201202100211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112001074299136 + 127803025 = 10583056^2 + 11305^2 .
It is a cyclic number.
It is not a de Polignac number, because 112001202102161 - 238 = 111726324195217 is a prime.
It is a super-2 number, since 2×1120012021021612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112001202102121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000601051080 + 56000601051081.
It is an arithmetic number, because the mean of its divisors is an integer number (56000601051081).
Almost surely, 2112001202102161 is an apocalyptic number.
It is an amenable number.
112001202102161 is a deficient number, since it is larger than the sum of its proper divisors (1).
112001202102161 is an equidigital number, since it uses as much as digits as its factorization.
112001202102161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 112001202102161 its reverse (161201202100211), we get a palindrome (273202404202372).
The spelling of 112001202102161 in words is "one hundred twelve trillion, one billion, two hundred two million, one hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •