Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …101001111000011111011 |
3 | 10220021011022122221101102 |
4 | 100001133111033003323 |
5 | 121020033410430021 |
6 | 2201502102442015 |
7 | 142360362220046 |
oct | 20013725170373 |
9 | 3807138587342 |
10 | 1101111030011 |
11 | 394a8451a313 |
12 | 15949ba3330b |
13 | 7cab001b595 |
14 | 3b418c77c5d |
15 | 1d9982b500b |
hex | 1005f54f0fb |
1101111030011 has 4 divisors (see below), whose sum is σ = 1101113137152. Its totient is φ = 1101108922872.
The previous prime is 1101111029999. The next prime is 1101111030013. The reversal of 1101111030011 is 1100301111011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1101111030011 - 210 = 1101111028987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101111029974 and 1101111030001.
It is not an unprimeable number, because it can be changed into a prime (1101111030013) 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, 385286 + ... + 1533188.
It is an arithmetic number, because the mean of its divisors is an integer number (275278284288).
Almost surely, 21101111030011 is an apocalyptic number.
1101111030011 is a deficient number, since it is larger than the sum of its proper divisors (2107141).
1101111030011 is an equidigital number, since it uses as much as digits as its factorization.
1101111030011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2107140.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 1101111030011 its reverse (1100301111011), we get a palindrome (2201412141022).
The spelling of 1101111030011 in words is "one trillion, one hundred one billion, one hundred eleven million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •