Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110101111111010101 |
3 | 10220011120122010202010200 |
4 | 100000203232311333111 |
5 | 121011011421010401 |
6 | 2201214543011113 |
7 | 142323531101463 |
oct | 20004356657725 |
9 | 3804518122120 |
10 | 1100111110101 |
11 | 394611050723 |
12 | 159260b99a99 |
13 | 7c980b0b9b3 |
14 | 3b36214b833 |
15 | 1d93a5ec686 |
hex | 10023bb5fd5 |
1100111110101 has 12 divisors (see below), whose sum is σ = 1592669089440. Its totient is φ = 731736772200.
The previous prime is 1100111110099. The next prime is 1100111110123. The reversal of 1100111110101 is 1010111110011.
It is not a de Polignac number, because 1100111110101 - 21 = 1100111110099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100111110171) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 139215375 + ... + 139223276.
It is an arithmetic number, because the mean of its divisors is an integer number (132722424120).
Almost surely, 21100111110101 is an apocalyptic number.
It is an amenable number.
1100111110101 is a deficient number, since it is larger than the sum of its proper divisors (492557979339).
1100111110101 is a wasteful number, since it uses less digits than its factorization.
1100111110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278439096 (or 278439093 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1100111110101 its reverse (1010111110011), we get a palindrome (2110222220112).
The spelling of 1100111110101 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •