Base | Representation |
---|---|
bin | 10000001010110011111… |
… | …110101010001111111011 |
3 | 10221012222221101200200010 |
4 | 100022303332222033323 |
5 | 121201034001010021 |
6 | 2210235245313003 |
7 | 143163421413543 |
oct | 20126376521773 |
9 | 3835887350603 |
10 | 1111121110011 |
11 | 399250999600 |
12 | 15b414265763 |
13 | 80a16b27b43 |
14 | 3bac84a2323 |
15 | 1dd81eb4976 |
hex | 102b3faa3fb |
1111121110011 has 12 divisors (see below), whose sum is σ = 1628419919336. Its totient is φ = 673406733120.
The previous prime is 1111121109883. The next prime is 1111121110061. The reversal of 1111121110011 is 1100111211111.
It is not a de Polignac number, because 1111121110011 - 27 = 1111121109883 is a prime.
It is a super-2 number, since 2×11111211100112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111121110061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1530469486 + ... + 1530470211.
Almost surely, 21111121110011 is an apocalyptic number.
1111121110011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1111121110011 is a deficient number, since it is larger than the sum of its proper divisors (517298809325).
1111121110011 is a wasteful number, since it uses less digits than its factorization.
1111121110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3060939722 (or 3060939711 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 1111121110011 its reverse (1100111211111), we get a palindrome (2211232321122).
It can be divided in two parts, 11111211100 and 11, that added together give a palindrome (11111211111).
The spelling of 1111121110011 in words is "one trillion, one hundred eleven billion, one hundred twenty-one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •