Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …000110000011000001011 |
3 | 10220011121020212101210121 |
4 | 100000210100300120023 |
5 | 121011021210000021 |
6 | 2201215501324111 |
7 | 142323666465544 |
oct | 20004420603013 |
9 | 3804536771717 |
10 | 1100120000011 |
11 | 39461607285a |
12 | 159263b66637 |
13 | 7c9829021b6 |
14 | 3b3633c34cb |
15 | 1d93b2a6741 |
hex | 1002443060b |
1100120000011 has 8 divisors (see below), whose sum is σ = 1106854754720. Its totient is φ = 1093395912192.
The previous prime is 1100119999991. The next prime is 1100120000029. The reversal of 1100120000011 is 1100000210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100120000011 - 219 = 1100119475723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100119999949 and 1100120000003.
It is not an unprimeable number, because it can be changed into a prime (1100120000071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2459775 + ... + 2872408.
It is an arithmetic number, because the mean of its divisors is an integer number (138356844340).
Almost surely, 21100120000011 is an apocalyptic number.
1100120000011 is a deficient number, since it is larger than the sum of its proper divisors (6734754709).
1100120000011 is a wasteful number, since it uses less digits than its factorization.
1100120000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5333445.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1100120000011 its reverse (1100000210011), we get a palindrome (2200120210022).
The spelling of 1100120000011 in words is "one trillion, one hundred billion, one hundred twenty million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •