Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …010110110000110111111 |
3 | 10220011021221222002100021 |
4 | 100000131022312012333 |
5 | 121010300224310421 |
6 | 2201200011113011 |
7 | 142321023212323 |
oct | 20003512660677 |
9 | 3804257862307 |
10 | 1100001010111 |
11 | 3945649909a3 |
12 | 159230142767 |
13 | 7c96406cc83 |
14 | 3b35168b983 |
15 | 1d930b00341 |
hex | 1001d2b61bf |
1100001010111 has 2 divisors, whose sum is σ = 1100001010112. Its totient is φ = 1100001010110.
The previous prime is 1100001010099. The next prime is 1100001010139. The reversal of 1100001010111 is 1110101000011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100001010111 - 27 = 1100001009983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100001010094 and 1100001010103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100008010111) 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, 550000505055 + 550000505056.
It is an arithmetic number, because the mean of its divisors is an integer number (550000505056).
Almost surely, 21100001010111 is an apocalyptic number.
1100001010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100001010111 is an equidigital number, since it uses as much as digits as its factorization.
1100001010111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100001010111 its reverse (1110101000011), we get a palindrome (2210102010122).
The spelling of 1100001010111 in words is "one trillion, one hundred billion, one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •