Base | Representation |
---|---|
bin | 110011110101000011… |
… | …1011110100100000101 |
3 | 101122021211100222212221 |
4 | 1213222013132210011 |
5 | 3310421303324031 |
6 | 123044220212341 |
7 | 11020111325206 |
oct | 1475207364405 |
9 | 348254328787 |
10 | 111302011141 |
11 | 432260a1382 |
12 | 196a299a0b1 |
13 | a65a18a3b9 |
14 | 555c0a95ad |
15 | 2d66583a11 |
hex | 19ea1de905 |
111302011141 has 2 divisors, whose sum is σ = 111302011142. Its totient is φ = 111302011140.
The previous prime is 111302011133. The next prime is 111302011169. The reversal of 111302011141 is 141110203111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108857104225 + 2444906916 = 329935^2 + 49446^2 .
It is a cyclic number.
It is not a de Polignac number, because 111302011141 - 23 = 111302011133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111302011741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55651005570 + 55651005571.
It is an arithmetic number, because the mean of its divisors is an integer number (55651005571).
Almost surely, 2111302011141 is an apocalyptic number.
It is an amenable number.
111302011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
111302011141 is an equidigital number, since it uses as much as digits as its factorization.
111302011141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 111302011141 its reverse (141110203111), we get a palindrome (252412214252).
The spelling of 111302011141 in words is "one hundred eleven billion, three hundred two million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •