Base | Representation |
---|---|
bin | 11001011111011011100110… |
… | …011011000101111100010111 |
3 | 112200221201100110211021221002 |
4 | 121133123212123011330113 |
5 | 104143312014132101403 |
6 | 1034235043535013515 |
7 | 32420521424364605 |
oct | 3137334633057427 |
9 | 480851313737832 |
10 | 112111102222103 |
11 | 327a4062523946 |
12 | 106a7a7136a29b |
13 | 4a730544b094a |
14 | 1d982c6130875 |
15 | ce640145c188 |
hex | 65f6e66c5f17 |
112111102222103 has 2 divisors, whose sum is σ = 112111102222104. Its totient is φ = 112111102222102.
The previous prime is 112111102222061. The next prime is 112111102222117. The reversal of 112111102222103 is 301222201111211.
It is a strong prime.
It is an emirp because it is prime and its reverse (301222201111211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112111102222103 - 220 = 112111101173527 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112111102222403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055551111051 + 56055551111052.
It is an arithmetic number, because the mean of its divisors is an integer number (56055551111052).
Almost surely, 2112111102222103 is an apocalyptic number.
112111102222103 is a deficient number, since it is larger than the sum of its proper divisors (1).
112111102222103 is an equidigital number, since it uses as much as digits as its factorization.
112111102222103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 112111102222103 its reverse (301222201111211), we get a palindrome (413333303333314).
The spelling of 112111102222103 in words is "one hundred twelve trillion, one hundred eleven billion, one hundred two million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •