Base | Representation |
---|---|
bin | 11001000010010101001000… |
… | …111100010010011001101001 |
3 | 112102212112111211202102102202 |
4 | 121002111020330102121221 |
5 | 103413030420341043423 |
6 | 1030104233312105545 |
7 | 32123164445650034 |
oct | 3102251074223151 |
9 | 472775454672382 |
10 | 110111300331113 |
11 | 320a2a38494314 |
12 | 104243838352b5 |
13 | 49595b2cc0c53 |
14 | 1d295b5ad001b |
15 | cae3aaa63728 |
hex | 642548f12669 |
110111300331113 has 2 divisors, whose sum is σ = 110111300331114. Its totient is φ = 110111300331112.
The previous prime is 110111300331041. The next prime is 110111300331119. The reversal of 110111300331113 is 311133003111011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104524184821849 + 5587115509264 = 10223707^2 + 2363708^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111300331113 - 218 = 110111300068969 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110111300331119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055650165556 + 55055650165557.
It is an arithmetic number, because the mean of its divisors is an integer number (55055650165557).
Almost surely, 2110111300331113 is an apocalyptic number.
It is an amenable number.
110111300331113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111300331113 is an equidigital number, since it uses as much as digits as its factorization.
110111300331113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 110111300331113 its reverse (311133003111011), we get a palindrome (421244303442124).
The spelling of 110111300331113 in words is "one hundred ten trillion, one hundred eleven billion, three hundred million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •