Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …111110010111001110111 |
3 | 10220021011100221000221222 |
4 | 100001133113302321313 |
5 | 121020034043413421 |
6 | 2201502125100555 |
7 | 142360401013442 |
oct | 20013727627167 |
9 | 3807140830858 |
10 | 1101111701111 |
11 | 394a84938544 |
12 | 1594a00b775b |
13 | 7cab01c4b96 |
14 | 3b418db0659 |
15 | 1d998398cab |
hex | 1005f5f2e77 |
1101111701111 has 2 divisors, whose sum is σ = 1101111701112. Its totient is φ = 1101111701110.
The previous prime is 1101111701089. The next prime is 1101111701143. The reversal of 1101111701111 is 1111071111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1101111701111 - 226 = 1101044592247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101111701111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101111701611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550555850555 + 550555850556.
It is an arithmetic number, because the mean of its divisors is an integer number (550555850556).
Almost surely, 21101111701111 is an apocalyptic number.
1101111701111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101111701111 is an equidigital number, since it uses as much as digits as its factorization.
1101111701111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 17.
Adding to 1101111701111 its reverse (1111071111011), we get a palindrome (2212182812122).
The spelling of 1101111701111 in words is "one trillion, one hundred one billion, one hundred eleven million, seven hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •