Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …100010101010000000111 |
3 | 10221012222022110111111112 |
4 | 100022303130111100013 |
5 | 121201024200023421 |
6 | 2210234324355235 |
7 | 143163252053642 |
oct | 20126334252007 |
9 | 3835868414445 |
10 | 1111112111111 |
11 | 3992469025a2 |
12 | 15b411245b1b |
13 | 80a14cc6b52 |
14 | 3bac71dca59 |
15 | 1dd812d845b |
hex | 102b3715407 |
1111112111111 has 16 divisors (see below), whose sum is σ = 1127164464000. Its totient is φ = 1095161760000.
The previous prime is 1111112111089. The next prime is 1111112111119.
1111112111111 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 1111112111111 - 26 = 1111112111047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111112111119) 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, 112217261 + ... + 112227161.
It is an arithmetic number, because the mean of its divisors is an integer number (70447779000).
Almost surely, 21111112111111 is an apocalyptic number.
1111112111111 is a deficient number, since it is larger than the sum of its proper divisors (16052352889).
1111112111111 is a wasteful number, since it uses less digits than its factorization.
1111112111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14890.
The product of its digits is 2, while the sum is 14.
It can be divided in two parts, 111111 and 2111111, that added together give a palindrome (2222222).
The spelling of 1111112111111 in words is "one trillion, one hundred eleven billion, one hundred twelve million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •