Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100100000100001001101 |
3 | 10220011112212020220112221 |
4 | 100000203010200201031 |
5 | 121011001100341414 |
6 | 2201213505055341 |
7 | 142323334550020 |
oct | 20004304404115 |
9 | 3804485226487 |
10 | 1100100012109 |
11 | 39460586062a |
12 | 159259327551 |
13 | 7c97b724437 |
14 | 3b36089d1b7 |
15 | 1d939659224 |
hex | 1002312084d |
1100100012109 has 16 divisors (see below), whose sum is σ = 1257984811648. Its totient is φ = 942397327872.
The previous prime is 1100100012091. The next prime is 1100100012131. The reversal of 1100100012109 is 9012100010011.
It is not a de Polignac number, because 1100100012109 - 27 = 1100100011981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100100012092 and 1100100012101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100100012509) 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 15 ways as a sum of consecutive naturals, for example, 153277729 + ... + 153284905.
It is an arithmetic number, because the mean of its divisors is an integer number (78624050728).
Almost surely, 21100100012109 is an apocalyptic number.
It is an amenable number.
1100100012109 is a deficient number, since it is larger than the sum of its proper divisors (157884799539).
1100100012109 is an equidigital number, since it uses as much as digits as its factorization.
1100100012109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16804.
The product of its (nonzero) digits is 18, while the sum is 16.
The spelling of 1100100012109 in words is "one trillion, one hundred billion, one hundred million, twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •