Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …001100011011101011010011 |
3 | 111010002221212121211100211022 |
4 | 112233112200030123223103 |
5 | 101102040012240213021 |
6 | 552412230350310055 |
7 | 30031361561022110 |
oct | 2657264014335323 |
9 | 433087777740738 |
10 | 100011001101011 |
11 | 299594779271a0 |
12 | b272975ab832b |
13 | 43a5cc6367780 |
14 | 1a9a7b5ccb907 |
15 | b867b04ca1ab |
hex | 5af5a031bad3 |
100011001101011 has 16 divisors (see below), whose sum is σ = 134280504976128. Its totient is φ = 71935984807200.
The previous prime is 100011001100981. The next prime is 100011001101013. The reversal of 100011001101011 is 110101100110001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100011001101011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100011001101011.
It is not an unprimeable number, because it can be changed into a prime (100011001101013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49955544005 + ... + 49955546006.
It is an arithmetic number, because the mean of its divisors is an integer number (8392531561008).
Almost surely, 2100011001101011 is an apocalyptic number.
100011001101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100011001101011 is a deficient number, since it is larger than the sum of its proper divisors (34269503875117).
100011001101011 is a wasteful number, since it uses less digits than its factorization.
100011001101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99911090042.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100011001101011 its reverse (110101100110001), we get a palindrome (210112101211012).
The spelling of 100011001101011 in words is "one hundred trillion, eleven billion, one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •