Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …000011111001100101111001 |
3 | 112102212111222221200100122001 |
4 | 121002110331003321211321 |
5 | 103413030013324000212 |
6 | 1030104201431501001 |
7 | 32123156505446653 |
oct | 3102247503714571 |
9 | 472774887610561 |
10 | 110111101000057 |
11 | 320a2945a18a03 |
12 | 10424328b27761 |
13 | 495958090c291 |
14 | 1d295974436d3 |
15 | cae3982dc657 |
hex | 64253d0f9979 |
110111101000057 has 2 divisors, whose sum is σ = 110111101000058. Its totient is φ = 110111101000056.
The previous prime is 110111101000007. The next prime is 110111101000133. The reversal of 110111101000057 is 750000101111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91102233473001 + 19008867527056 = 9544749^2 + 4359916^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111101000057 - 215 = 110111100967289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111100999998 and 110111101000043.
It is not a weakly prime, because it can be changed into another prime (110111101000007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055550500028 + 55055550500029.
It is an arithmetic number, because the mean of its divisors is an integer number (55055550500029).
Almost surely, 2110111101000057 is an apocalyptic number.
It is an amenable number.
110111101000057 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111101000057 is an equidigital number, since it uses as much as digits as its factorization.
110111101000057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35, while the sum is 19.
Adding to 110111101000057 its reverse (750000101111011), we get a palindrome (860111202111068).
The spelling of 110111101000057 in words is "one hundred ten trillion, one hundred eleven billion, one hundred one million, fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •