Base | Representation |
---|---|
bin | 11001011111010100001111… |
… | …100110110000011101101101 |
3 | 112200220221221222102221220122 |
4 | 121133110033212300131231 |
5 | 104143144330010223432 |
6 | 1034231300043454325 |
7 | 32420121611036216 |
oct | 3137241746603555 |
9 | 480827858387818 |
10 | 112103203211117 |
11 | 327a0779762a98 |
12 | 106a6427b273a5 |
13 | 4a72395b69551 |
14 | 1d97b7703440d |
15 | ce60dcc5e612 |
hex | 65f50f9b076d |
112103203211117 has 2 divisors, whose sum is σ = 112103203211118. Its totient is φ = 112103203211116.
The previous prime is 112103203211101. The next prime is 112103203211137. The reversal of 112103203211117 is 711112302301211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67531102788361 + 44572100422756 = 8217731^2 + 6676234^2 .
It is a cyclic number.
It is not a de Polignac number, because 112103203211117 - 24 = 112103203211101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112103203211137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56051601605558 + 56051601605559.
It is an arithmetic number, because the mean of its divisors is an integer number (56051601605559).
Almost surely, 2112103203211117 is an apocalyptic number.
It is an amenable number.
112103203211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
112103203211117 is an equidigital number, since it uses as much as digits as its factorization.
112103203211117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 26.
Adding to 112103203211117 its reverse (711112302301211), we get a palindrome (823215505512328).
The spelling of 112103203211117 in words is "one hundred twelve trillion, one hundred three billion, two hundred three million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •