Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110101111101101111 |
3 | 10220011120122010201222220 |
4 | 100000203232311331233 |
5 | 121011011421004444 |
6 | 2201214543010423 |
7 | 142323531101256 |
oct | 20004356657557 |
9 | 3804518121886 |
10 | 1100111109999 |
11 | 394611050640 |
12 | 159260b99a13 |
13 | 7c980b0b935 |
14 | 3b36214b79d |
15 | 1d93a5ec619 |
hex | 10023bb5f6f |
1100111109999 has 16 divisors (see below), whose sum is σ = 1600219300224. Its totient is φ = 666709970400.
The previous prime is 1100111109973. The next prime is 1100111110051. The reversal of 1100111109999 is 9999011110011.
It is not a de Polignac number, because 1100111109999 - 27 = 1100111109871 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100111109999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100111109199) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 350877 + ... + 1524249.
It is an arithmetic number, because the mean of its divisors is an integer number (100013706264).
Almost surely, 21100111109999 is an apocalyptic number.
1100111109999 is a deficient number, since it is larger than the sum of its proper divisors (500108190225).
1100111109999 is a wasteful number, since it uses less digits than its factorization.
1100111109999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1201798.
The product of its (nonzero) digits is 6561, while the sum is 42.
The spelling of 1100111109999 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •