Base | Representation |
---|---|
bin | 1010001100101000010111… |
… | …0110001010110000101101 |
3 | 1110200212102020102212210102 |
4 | 2203022011312022300231 |
5 | 2432144400203242031 |
6 | 35502434453320445 |
7 | 2235022354221266 |
oct | 243120566126055 |
9 | 43625366385712 |
10 | 11212110212141 |
11 | 3633035a087a3 |
12 | 1310b95036125 |
13 | 6343b3685817 |
14 | 2aa951b6396d |
15 | 1469bcdbe7cb |
hex | a3285d8ac2d |
11212110212141 has 2 divisors, whose sum is σ = 11212110212142. Its totient is φ = 11212110212140.
The previous prime is 11212110212119. The next prime is 11212110212179. The reversal of 11212110212141 is 14121201121211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8821963292041 + 2390146920100 = 2970179^2 + 1546010^2 .
It is a cyclic number.
It is not a de Polignac number, because 11212110212141 - 214 = 11212110195757 is a prime.
It is a super-2 number, since 2×112121102121412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11212110212041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606055106070 + 5606055106071.
It is an arithmetic number, because the mean of its divisors is an integer number (5606055106071).
Almost surely, 211212110212141 is an apocalyptic number.
It is an amenable number.
11212110212141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212110212141 is an equidigital number, since it uses as much as digits as its factorization.
11212110212141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 11212110212141 its reverse (14121201121211), we get a palindrome (25333311333352).
The spelling of 11212110212141 in words is "eleven trillion, two hundred twelve billion, one hundred ten million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •