Base | Representation |
---|---|
bin | 111110111010011… |
… | …0111100101000101 |
3 | 12110010020110212211 |
4 | 1331310313211011 |
5 | 13310404324031 |
6 | 545250143421 |
7 | 103212204301 |
oct | 17564674505 |
9 | 5403213784 |
10 | 2111011141 |
11 | 993679a08 |
12 | 4aab81b71 |
13 | 278474a25 |
14 | 160514d01 |
15 | c54debb1 |
hex | 7dd37945 |
2111011141 has 2 divisors, whose sum is σ = 2111011142. Its totient is φ = 2111011140.
The previous prime is 2111011129. The next prime is 2111011151. The reversal of 2111011141 is 1411101112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1810162116 + 300849025 = 42546^2 + 17345^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111011141 - 225 = 2077456709 is a prime.
It is a super-2 number, since 2×21110111412 = 8912736074852243762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111011151) 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, 1055505570 + 1055505571.
It is an arithmetic number, because the mean of its divisors is an integer number (1055505571).
Almost surely, 22111011141 is an apocalyptic number.
It is an amenable number.
2111011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111011141 is an equidigital number, since it uses as much as digits as its factorization.
2111011141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
The square root of 2111011141 is about 45945.7412716347. The cubic root of 2111011141 is about 1282.8134608909.
Adding to 2111011141 its reverse (1411101112), we get a palindrome (3522112253).
The spelling of 2111011141 in words is "two billion, one hundred eleven million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •