Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010000010101110011011101 |
3 | 111010110112000111022012222100 |
4 | 112300303221100111303131 |
5 | 101110204322321010414 |
6 | 552530210312035313 |
7 | 30041532116045466 |
oct | 2660635120256335 |
9 | 433415014265870 |
10 | 100111011110109 |
11 | 2999792897927a |
12 | b28a227092b39 |
13 | 43b2573c6cc4c |
14 | 1aa15823d5d6d |
15 | b891b5540609 |
hex | 5b0ce9415cdd |
100111011110109 has 48 divisors (see below), whose sum is σ = 153752800007664. Its totient is φ = 62551454515200.
The previous prime is 100111011110083. The next prime is 100111011110147. The reversal of 100111011110109 is 901011110111001.
It can be written as a sum of positive squares in 8 ways, for example, as 359456605209 + 99751554504900 = 599547^2 + 9987570^2 .
It is not a de Polignac number, because 100111011110109 - 227 = 100110876892381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111011110091 and 100111011110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111011100109) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1217247229 + ... + 1217329469.
It is an arithmetic number, because the mean of its divisors is an integer number (3203183333493).
Almost surely, 2100111011110109 is an apocalyptic number.
It is an amenable number.
100111011110109 is a deficient number, since it is larger than the sum of its proper divisors (53641788897555).
100111011110109 is a wasteful number, since it uses less digits than its factorization.
100111011110109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115518 (or 115515 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 100111011110109 in words is "one hundred trillion, one hundred eleven billion, eleven million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •