Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101101100001000001011 |
3 | 10220020212120202000212012 |
4 | 100001120231230020023 |
5 | 121014322000000021 |
6 | 2201443055010135 |
7 | 142354543405322 |
oct | 20013055541013 |
9 | 3806776660765 |
10 | 1101000000011 |
11 | 394a2788488a |
12 | 15946a80994b |
13 | 7ca93015462 |
14 | 3b4082150b9 |
15 | 1d98d68235b |
hex | 10058b6c20b |
1101000000011 has 4 divisors (see below), whose sum is σ = 1165764705912. Its totient is φ = 1036235294112.
The previous prime is 1100999999993. The next prime is 1101000000029. The reversal of 1101000000011 is 1100000001011.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1100999999993) and next prime (1101000000029).
It is a cyclic number.
It is not a de Polignac number, because 1101000000011 - 218 = 1100999737867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100999999941 and 1101000000004.
It is not an unprimeable number, because it can be changed into a prime (1101000000211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32382352925 + ... + 32382352958.
It is an arithmetic number, because the mean of its divisors is an integer number (291441176478).
Almost surely, 21101000000011 is an apocalyptic number.
1101000000011 is a deficient number, since it is larger than the sum of its proper divisors (64764705901).
1101000000011 is an equidigital number, since it uses as much as digits as its factorization.
1101000000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64764705900.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 1101000000011 its reverse (1100000001011), we get a palindrome (2201000001022).
The spelling of 1101000000011 in words is "one trillion, one hundred one billion, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •