Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …1000010010011001101101 |
3 | 1110100010010001022002000011 |
4 | 2201223011220102121231 |
5 | 2424011441340201031 |
6 | 35343524320133221 |
7 | 2224451443120351 |
oct | 241530550223155 |
9 | 43303101262004 |
10 | 11110101100141 |
11 | 35a384948205a |
12 | 12b5266467211 |
13 | 6278a785b414 |
14 | 2a5a35d55461 |
15 | 143eec5c26b1 |
hex | a1ac5a1266d |
11110101100141 has 2 divisors, whose sum is σ = 11110101100142. Its totient is φ = 11110101100140.
The previous prime is 11110101100103. The next prime is 11110101100171. The reversal of 11110101100141 is 14100110101111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11015455654116 + 94645446025 = 3318954^2 + 307645^2 .
It is an emirp because it is prime and its reverse (14100110101111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110101100141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110101100171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555050550070 + 5555050550071.
It is an arithmetic number, because the mean of its divisors is an integer number (5555050550071).
Almost surely, 211110101100141 is an apocalyptic number.
It is an amenable number.
11110101100141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110101100141 is an equidigital number, since it uses as much as digits as its factorization.
11110101100141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11110101100141 its reverse (14100110101111), we get a palindrome (25210211201252).
The spelling of 11110101100141 in words is "eleven trillion, one hundred ten billion, one hundred one million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •