Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100010101111011000001101 |
3 | 112102111221212201100021212221 |
4 | 121000313310202233120031 |
5 | 103404410213111200414 |
6 | 1025550222433255341 |
7 | 32113016421022465 |
oct | 3100676442573015 |
9 | 472457781307787 |
10 | 110011100100109 |
11 | 3206449a02874a |
12 | 10408a7aa04551 |
13 | 4950004b76030 |
14 | 1d247cc22aba5 |
15 | cab993e76224 |
hex | 640df48af60d |
110011100100109 has 16 divisors (see below), whose sum is σ = 120704219677440. Its totient is φ = 99643018760640.
The previous prime is 110011100100071. The next prime is 110011100100149. The reversal of 110011100100109 is 901001001110011.
It is a cyclic number.
It is not a de Polignac number, because 110011100100109 - 211 = 110011100098061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110011100100092 and 110011100100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011100100149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 132145477 + ... + 132975370.
It is an arithmetic number, because the mean of its divisors is an integer number (7544013729840).
Almost surely, 2110011100100109 is an apocalyptic number.
It is an amenable number.
110011100100109 is a deficient number, since it is larger than the sum of its proper divisors (10693119577331).
110011100100109 is a wasteful number, since it uses less digits than its factorization.
110011100100109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265121460.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 110011100100109 in words is "one hundred ten trillion, eleven billion, one hundred million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •