Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …101100011100010111011 |
3 | 10221022022000222011220010 |
4 | 100023221011203202323 |
5 | 121204400100010021 |
6 | 2210503514433003 |
7 | 143224460656305 |
oct | 20135105434273 |
9 | 3838260864803 |
10 | 1112012110011 |
11 | 399668934040 |
12 | 15b622732763 |
13 | 80b295bcb8a |
14 | 3bb70958975 |
15 | 1ddd5314976 |
hex | 102e91638bb |
1112012110011 has 16 divisors (see below), whose sum is σ = 1617506754048. Its totient is φ = 673932319200.
The previous prime is 1112012110009. The next prime is 1112012110081. The reversal of 1112012110011 is 1100112102111.
It is not a de Polignac number, because 1112012110011 - 21 = 1112012110009 is a prime.
It is a super-2 number, since 2×11120121100112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1112012110081) 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 15 ways as a sum of consecutive naturals, for example, 1323390 + ... + 1993836.
It is an arithmetic number, because the mean of its divisors is an integer number (101094172128).
Almost surely, 21112012110011 is an apocalyptic number.
1112012110011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1112012110011 is a deficient number, since it is larger than the sum of its proper divisors (505494644037).
1112012110011 is a wasteful number, since it uses less digits than its factorization.
1112012110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720722.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1112012110011 its reverse (1100112102111), we get a palindrome (2212124212122).
The spelling of 1112012110011 in words is "one trillion, one hundred twelve billion, twelve million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •