Base | Representation |
---|---|
bin | 10000001010101101011… |
… | …010101010101001000101 |
3 | 10221012201021020002102012 |
4 | 100022231122222221011 |
5 | 121200322304324031 |
6 | 2210220313424005 |
7 | 143160613530563 |
oct | 20125532525105 |
9 | 3835637202365 |
10 | 1111011011141 |
11 | 3991a482a6a9 |
12 | 15b3a340b005 |
13 | 809ca089795 |
14 | 3bab7a02a33 |
15 | 1dd774b7b2b |
hex | 102ad6aaa45 |
1111011011141 has 2 divisors, whose sum is σ = 1111011011142. Its totient is φ = 1111011011140.
The previous prime is 1111011011083. The next prime is 1111011011189. The reversal of 1111011011141 is 1411101101111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1110431212900 + 579798241 = 1053770^2 + 24079^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111011011141 - 222 = 1111006816837 is a prime.
It is a super-3 number, since 3×11110110111413 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111011011741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555505505570 + 555505505571.
It is an arithmetic number, because the mean of its divisors is an integer number (555505505571).
Almost surely, 21111011011141 is an apocalyptic number.
It is an amenable number.
1111011011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111011011141 is an equidigital number, since it uses as much as digits as its factorization.
1111011011141 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 14.
Adding to 1111011011141 its reverse (1411101101111), we get a palindrome (2522112112252).
The spelling of 1111011011141 in words is "one trillion, one hundred eleven billion, eleven million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •