Base | Representation |
---|---|
bin | 11001001111011011000100… |
… | …100010000111111001101011 |
3 | 112120001112211222211102122012 |
4 | 121033123010202013321223 |
5 | 104022301033113341021 |
6 | 1032033432014150135 |
7 | 32245165420030442 |
oct | 3117330442077153 |
9 | 476045758742565 |
10 | 111011022012011 |
11 | 3240a567968920 |
12 | 1054a81a7b234b |
13 | 49c33a9c007a4 |
14 | 1d5ad68147d59 |
15 | cc79b891535b |
hex | 64f6c4887e6b |
111011022012011 has 4 divisors (see below), whose sum is σ = 121102933104024. Its totient is φ = 100919110920000.
The previous prime is 111011022011941. The next prime is 111011022012013. The reversal of 111011022012011 is 110210220110111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111011022012011 - 218 = 111011021749867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111011022012013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5045955545990 + ... + 5045955546011.
It is an arithmetic number, because the mean of its divisors is an integer number (30275733276006).
Almost surely, 2111011022012011 is an apocalyptic number.
111011022012011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
111011022012011 is a deficient number, since it is larger than the sum of its proper divisors (10091911092013).
111011022012011 is a wasteful number, since it uses less digits than its factorization.
111011022012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10091911092012.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111011022012011 its reverse (110210220110111), we get a palindrome (221221242122122).
The spelling of 111011022012011 in words is "one hundred eleven trillion, eleven billion, twenty-two million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •