Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1111101111010100101 |
3 | 101121112111002221100211 |
4 | 1213120231331322211 |
5 | 3304322042024031 |
6 | 122555231535421 |
7 | 11006635242616 |
oct | 1473055757245 |
9 | 347474087324 |
10 | 111010111141 |
11 | 4309634a606 |
12 | 1962108a571 |
13 | a6118673c7 |
14 | 5531403c0d |
15 | 2d4ab24bb1 |
hex | 19d8b7dea5 |
111010111141 has 2 divisors, whose sum is σ = 111010111142. Its totient is φ = 111010111140.
The previous prime is 111010111099. The next prime is 111010111193. The reversal of 111010111141 is 141111010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109514664900 + 1495446241 = 330930^2 + 38671^2 .
It is a cyclic number.
It is not a de Polignac number, because 111010111141 - 231 = 108862627493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111017111141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505055570 + 55505055571.
It is an arithmetic number, because the mean of its divisors is an integer number (55505055571).
Almost surely, 2111010111141 is an apocalyptic number.
It is an amenable number.
111010111141 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010111141 is an equidigital number, since it uses as much as digits as its factorization.
111010111141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111010111141 its reverse (141111010111), we get a palindrome (252121121252).
It can be divided in two parts, 111010111 and 141, that multiplied together give a palindrome (15652425651).
The spelling of 111010111141 in words is "one hundred eleven billion, ten million, one hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •