Base | Representation |
---|---|
bin | 1010001000011100111001… |
… | …0010011010000000011101 |
3 | 1110110000002102210121101011 |
4 | 2202013032102122000131 |
5 | 2430010324122131031 |
6 | 35405442134015221 |
7 | 2226601203126514 |
oct | 242071622320035 |
9 | 43400072717334 |
10 | 11140311130141 |
11 | 36056412297a6 |
12 | 12bb0977a7511 |
13 | 62a6b05acc0b |
14 | 2a72a023367b |
15 | 144bb98876b1 |
hex | a21ce49a01d |
11140311130141 has 2 divisors, whose sum is σ = 11140311130142. Its totient is φ = 11140311130140.
The previous prime is 11140311130121. The next prime is 11140311130153. The reversal of 11140311130141 is 14103111304111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11059415824900 + 80895305241 = 3325570^2 + 284421^2 .
It is an emirp because it is prime and its reverse (14103111304111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11140311130141 - 213 = 11140311121949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11140311130121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5570155565070 + 5570155565071.
It is an arithmetic number, because the mean of its divisors is an integer number (5570155565071).
Almost surely, 211140311130141 is an apocalyptic number.
It is an amenable number.
11140311130141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11140311130141 is an equidigital number, since it uses as much as digits as its factorization.
11140311130141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 11140311130141 its reverse (14103111304111), we get a palindrome (25243422434252).
The spelling of 11140311130141 in words is "eleven trillion, one hundred forty billion, three hundred eleven million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •