Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …001101011011101011000011 |
3 | 111010110112021110021201020202 |
4 | 112300303233031123223003 |
5 | 101110210023404323021 |
6 | 552530224241155415 |
7 | 30041534441145662 |
oct | 2660635715335303 |
9 | 433415243251222 |
10 | 100111111011011 |
11 | 2999797a302301 |
12 | b28a25462bb6b |
13 | 43b258b87a5c9 |
14 | 1aa159179cdd9 |
15 | b891be1c5a0b |
hex | 5b0cef35bac3 |
100111111011011 has 8 divisors (see below), whose sum is σ = 100461124367280. Its totient is φ = 99761289818112.
The previous prime is 100111111010987. The next prime is 100111111011013. The reversal of 100111111011011 is 110110111111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100111111011011 - 214 = 100111110994627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100111111010983 and 100111111011001.
It is not an unprimeable number, because it can be changed into a prime (100111111011013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46997045 + ... + 49080998.
It is an arithmetic number, because the mean of its divisors is an integer number (12557640545910).
Almost surely, 2100111111011011 is an apocalyptic number.
100111111011011 is a deficient number, since it is larger than the sum of its proper divisors (350013356269).
100111111011011 is an equidigital number, since it uses as much as digits as its factorization.
100111111011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96081685.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 100111111011011 its reverse (110110111111001), we get a palindrome (210221222122012).
The spelling of 100111111011011 in words is "one hundred trillion, one hundred eleven billion, one hundred eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •