Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000110110100001011111011 |
3 | 112102212111201222200221221212 |
4 | 121002110313012310023323 |
5 | 103413024312240213201 |
6 | 1030104143502353335 |
7 | 32123154153355136 |
oct | 3102246706641373 |
9 | 472774658627855 |
10 | 110111001101051 |
11 | 320a28a4596345 |
12 | 104242bb58b84b |
13 | 4959566002742 |
14 | 1d2958807b21d |
15 | cae38e657abb |
hex | 6425371b42fb |
110111001101051 has 2 divisors, whose sum is σ = 110111001101052. Its totient is φ = 110111001101050.
The previous prime is 110111001101041. The next prime is 110111001101053. The reversal of 110111001101051 is 150101100111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111001101051 - 222 = 110110996906747 is a prime.
Together with 110111001101053, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110111001101053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055500550525 + 55055500550526.
It is an arithmetic number, because the mean of its divisors is an integer number (55055500550526).
Almost surely, 2110111001101051 is an apocalyptic number.
110111001101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111001101051 is an equidigital number, since it uses as much as digits as its factorization.
110111001101051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 14.
Adding to 110111001101051 its reverse (150101100111011), we get a palindrome (260212101212062).
The spelling of 110111001101051 in words is "one hundred ten trillion, one hundred eleven billion, one million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •