Base | Representation |
---|---|
bin | 11001011111011011100001… |
… | …100010010010001010111001 |
3 | 112200221201010202112012201101 |
4 | 121133123201202102022321 |
5 | 104143311332134033423 |
6 | 1034235031445251401 |
7 | 32420516410365634 |
oct | 3137334142221271 |
9 | 480851122465641 |
10 | 112111020221113 |
11 | 327a4020206331 |
12 | 106a7a49a03b61 |
13 | 4a730404cc854 |
14 | 1d982b92a6c1b |
15 | ce63e91607ad |
hex | 65f6e18922b9 |
112111020221113 has 2 divisors, whose sum is σ = 112111020221114. Its totient is φ = 112111020221112.
The previous prime is 112111020221111. The next prime is 112111020221129. The reversal of 112111020221113 is 311122020111211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111552633175104 + 558387046009 = 10561848^2 + 747253^2 .
It is a cyclic number.
It is not a de Polignac number, because 112111020221113 - 21 = 112111020221111 is a prime.
Together with 112111020221111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (112111020221111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055510110556 + 56055510110557.
It is an arithmetic number, because the mean of its divisors is an integer number (56055510110557).
Almost surely, 2112111020221113 is an apocalyptic number.
It is an amenable number.
112111020221113 is a deficient number, since it is larger than the sum of its proper divisors (1).
112111020221113 is an equidigital number, since it uses as much as digits as its factorization.
112111020221113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 112111020221113 its reverse (311122020111211), we get a palindrome (423233040332324).
The spelling of 112111020221113 in words is "one hundred twelve trillion, one hundred eleven billion, twenty million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •