Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …110010110010100101111 |
3 | 10220100111001010011021100 |
4 | 100002110332112110233 |
5 | 121023404304000421 |
6 | 2202131252134143 |
7 | 142421600642430 |
oct | 20022476262457 |
9 | 3810431104240 |
10 | 1102011000111 |
11 | 3953a653115a |
12 | 1596b1307353 |
13 | 7cbc4604478 |
14 | 3b4a25c7487 |
15 | 1d9ec2d7c26 |
hex | 10094f9652f |
1102011000111 has 12 divisors (see below), whose sum is σ = 1819192762192. Its totient is φ = 629720571456.
The previous prime is 1102011000091. The next prime is 1102011000119. The reversal of 1102011000111 is 1110001102011.
It is not a de Polignac number, because 1102011000111 - 27 = 1102010999983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102011000093 and 1102011000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102011000119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8746118986 + ... + 8746119111.
Almost surely, 21102011000111 is an apocalyptic number.
1102011000111 is a deficient number, since it is larger than the sum of its proper divisors (717181762081).
1102011000111 is a wasteful number, since it uses less digits than its factorization.
1102011000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17492238110 (or 17492238107 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1102011000111 its reverse (1110001102011), we get a palindrome (2212012102122).
The spelling of 1102011000111 in words is "one trillion, one hundred two billion, eleven million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •