Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000110110100010000001111 |
3 | 112102212111201222200222100002 |
4 | 121002110313012310100033 |
5 | 103413024312240220302 |
6 | 1030104143502354515 |
7 | 32123154153356012 |
oct | 3102246706642017 |
9 | 472774658628302 |
10 | 110111001101327 |
11 | 320a28a4596576 |
12 | 104242bb58ba3b |
13 | 49595660028c5 |
14 | 1d2958807b379 |
15 | cae38e657c02 |
hex | 6425371b440f |
110111001101327 has 2 divisors, whose sum is σ = 110111001101328. Its totient is φ = 110111001101326.
The previous prime is 110111001101239. The next prime is 110111001101329. The reversal of 110111001101327 is 723101100111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111001101327 - 212 = 110111001097231 is a prime.
Together with 110111001101329, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111001101299 and 110111001101308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111001101329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055500550663 + 55055500550664.
It is an arithmetic number, because the mean of its divisors is an integer number (55055500550664).
Almost surely, 2110111001101327 is an apocalyptic number.
110111001101327 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111001101327 is an equidigital number, since it uses as much as digits as its factorization.
110111001101327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 110111001101327 its reverse (723101100111011), we get a palindrome (833212101212338).
The spelling of 110111001101327 in words is "one hundred ten trillion, one hundred eleven billion, one million, one hundred one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •