Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101100100000001011111 |
3 | 10220011022121002110111212 |
4 | 100000131231210001133 |
5 | 121010310042023241 |
6 | 2201200534135035 |
7 | 142321163445614 |
oct | 20003555440137 |
9 | 3804277073455 |
10 | 1100010111071 |
11 | 39456a037653 |
12 | 1592331b147b |
13 | 7c965c08561 |
14 | 3b35297a50b |
15 | 1d9317ebbeb |
hex | 1001db6405f |
1100010111071 has 2 divisors, whose sum is σ = 1100010111072. Its totient is φ = 1100010111070.
The previous prime is 1100010111001. The next prime is 1100010111073. The reversal of 1100010111071 is 1701110100011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100010111071 - 230 = 1098936369247 is a prime.
Together with 1100010111073, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100010111073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550005055535 + 550005055536.
It is an arithmetic number, because the mean of its divisors is an integer number (550005055536).
Almost surely, 21100010111071 is an apocalyptic number.
1100010111071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100010111071 is an equidigital number, since it uses as much as digits as its factorization.
1100010111071 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 14.
Adding to 1100010111071 its reverse (1701110100011), we get a palindrome (2801120211082).
The spelling of 1100010111071 in words is "one trillion, one hundred billion, ten million, one hundred eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •