Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110011100001101001 |
3 | 10220011120122010020021220 |
4 | 100000203232303201221 |
5 | 121011011420200014 |
6 | 2201214542452253 |
7 | 142323531030165 |
oct | 20004356634151 |
9 | 3804518106256 |
10 | 1100111100009 |
11 | 394611044089 |
12 | 159260b94089 |
13 | 7c980b0721c |
14 | 3b362147ca5 |
15 | 1d93a5e96a9 |
hex | 10023bb3869 |
1100111100009 has 144 divisors (see below), whose sum is σ = 1662731500032. Its totient is φ = 646133760000.
The previous prime is 1100111100007. The next prime is 1100111100031. The reversal of 1100111100009 is 9000011110011.
It is not a de Polignac number, because 1100111100009 - 21 = 1100111100007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100111100007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 5700057417 + ... + 5700057609.
It is an arithmetic number, because the mean of its divisors is an integer number (11546746528).
Almost surely, 21100111100009 is an apocalyptic number.
1100111100009 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1100111100009 is a deficient number, since it is larger than the sum of its proper divisors (562620400023).
1100111100009 is a wasteful number, since it uses less digits than its factorization.
1100111100009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448 (or 388 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 15.
The spelling of 1100111100009 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •