Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …110111111110000101111 |
3 | 10220011021220001211012102 |
4 | 100000131012333300233 |
5 | 121010300000013241 |
6 | 2201155533325315 |
7 | 142321011510446 |
oct | 20003506776057 |
9 | 3804256054172 |
10 | 1100000001071 |
11 | 394564361884 |
12 | 15922b93683b |
13 | 7c963aa88ca |
14 | 3b3514a7d5d |
15 | 1d9309a139b |
hex | 1001d1bfc2f |
1100000001071 has 2 divisors, whose sum is σ = 1100000001072. Its totient is φ = 1100000001070.
The previous prime is 1100000001041. The next prime is 1100000001073. The reversal of 1100000001071 is 1701000000011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100000001071 - 218 = 1099999738927 is a prime.
It is a super-2 number, since 2×11000000010712 (a number of 25 digits) contains 22 as substring.
Together with 1100000001073, 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 (1100000001073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000000535 + 550000000536.
It is an arithmetic number, because the mean of its divisors is an integer number (550000000536).
Almost surely, 21100000001071 is an apocalyptic number.
1100000001071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100000001071 is an equidigital number, since it uses as much as digits as its factorization.
1100000001071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 11.
Adding to 1100000001071 its reverse (1701000000011), we get a palindrome (2801000001082).
The spelling of 1100000001071 in words is "one trillion, one hundred billion, one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •