Base | Representation |
---|---|
bin | 10000001010110010101… |
… | …110100001000110010011 |
3 | 10221012221110212022202000 |
4 | 100022302232201012103 |
5 | 121201013111213021 |
6 | 2210233215125043 |
7 | 143163045013035 |
oct | 20126256410623 |
9 | 3835843768660 |
10 | 1111100101011 |
11 | 39924004a19a |
12 | 15b409213783 |
13 | 80a12680394 |
14 | 3bac5793c55 |
15 | 1dd80214b26 |
hex | 102b2ba1193 |
1111100101011 has 16 divisors (see below), whose sum is σ = 1659035443200. Its totient is φ = 734900851944.
The previous prime is 1111100101009. The next prime is 1111100101021. The reversal of 1111100101011 is 1101010011111.
It is not a de Polignac number, because 1111100101011 - 21 = 1111100101009 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 = 1111100100984 and 1111100101002.
It is not an unprimeable number, because it can be changed into a prime (1111100101021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162011751 + ... + 162018608.
It is an arithmetic number, because the mean of its divisors is an integer number (103689715200).
Almost surely, 21111100101011 is an apocalyptic number.
1111100101011 is a deficient number, since it is larger than the sum of its proper divisors (547935342189).
1111100101011 is a wasteful number, since it uses less digits than its factorization.
1111100101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324030495 (or 324030489 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1111100101011 its reverse (1101010011111), we get a palindrome (2212110112122).
The spelling of 1111100101011 in words is "one trillion, one hundred eleven billion, one hundred million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •