Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110101111110100100 |
3 | 10220011120122010202001212 |
4 | 100000203232311332210 |
5 | 121011011421010202 |
6 | 2201214543010552 |
7 | 142323531101363 |
oct | 20004356657644 |
9 | 3804518122055 |
10 | 1100111110052 |
11 | 394611050689 |
12 | 159260b99a58 |
13 | 7c980b0b976 |
14 | 3b36214b7da |
15 | 1d93a5ec652 |
hex | 10023bb5fa4 |
1100111110052 has 12 divisors (see below), whose sum is σ = 1926124952220. Its totient is φ = 549789695136.
The previous prime is 1100111110051. The next prime is 1100111110073. The reversal of 1100111110052 is 2500111110011.
It can be written as a sum of positive squares in 2 ways, for example, as 85127398756 + 1014983711296 = 291766^2 + 1007464^2 .
It is not an unprimeable number, because it can be changed into a prime (1100111110051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66455663 + ... + 66472214.
It is an arithmetic number, because the mean of its divisors is an integer number (160510412685).
Almost surely, 21100111110052 is an apocalyptic number.
It is an amenable number.
1100111110052 is a deficient number, since it is larger than the sum of its proper divisors (826013842168).
1100111110052 is a wasteful number, since it uses less digits than its factorization.
1100111110052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132929950 (or 132929948 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 1100111110052 its reverse (2500111110011), we get a palindrome (3600222220063).
The spelling of 1100111110052 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •