Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001101111010101111101011 |
3 | 111020222011121120021222021100 |
4 | 112333031233031322233223 |
5 | 101222420023340200021 |
6 | 555005112112412443 |
7 | 30203212351104015 |
oct | 2677155715725753 |
9 | 436864546258240 |
10 | 101101101100011 |
11 | 2a239810963981 |
12 | b40a0a2247123 |
13 | 4454a4009878c |
14 | 1ad74686231b5 |
15 | ba4d11c72626 |
hex | 5bf36f37abeb |
101101101100011 has 24 divisors (see below), whose sum is σ = 146162247528960. Its totient is φ = 67341975667200.
The previous prime is 101101101099991. The next prime is 101101101100019. The reversal of 101101101100011 is 110001101101101.
It is not a de Polignac number, because 101101101100011 - 241 = 98902077844459 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101101101099966 and 101101101100002.
It is not an unprimeable number, because it can be changed into a prime (101101101100019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 196529371 + ... + 197043131.
It is an arithmetic number, because the mean of its divisors is an integer number (6090093647040).
Almost surely, 2101101101100011 is an apocalyptic number.
101101101100011 is a deficient number, since it is larger than the sum of its proper divisors (45061146428949).
101101101100011 is a wasteful number, since it uses less digits than its factorization.
101101101100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532787 (or 532784 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101101101100011 its reverse (110001101101101), we get a palindrome (211102202201112).
The spelling of 101101101100011 in words is "one hundred one trillion, one hundred one billion, one hundred one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •