Base | Representation |
---|---|
bin | 11001001111011011010000… |
… | …010101110110000111001011 |
3 | 112120001120100210121100201112 |
4 | 121033123100111312013023 |
5 | 104022301434322320021 |
6 | 1032033503412240535 |
7 | 32245203343645001 |
oct | 3117332025660713 |
9 | 476046323540645 |
10 | 111011220120011 |
11 | 3240a659779342 |
12 | 1054a87501014b |
13 | 49c340bc74863 |
14 | 1d5ad86596a71 |
15 | cc79caee8d5b |
hex | 64f6d05761cb |
111011220120011 has 4 divisors (see below), whose sum is σ = 112892766223800. Its totient is φ = 109129674016224.
The previous prime is 111011220119957. The next prime is 111011220120061. The reversal of 111011220120011 is 110021022110111.
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 111011220120011 - 226 = 111011153011147 is a prime.
It is a super-2 number, since 2×1110112201200112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111011220120061) 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, 940773051806 + ... + 940773051923.
It is an arithmetic number, because the mean of its divisors is an integer number (28223191555950).
Almost surely, 2111011220120011 is an apocalyptic number.
111011220120011 is a deficient number, since it is larger than the sum of its proper divisors (1881546103789).
111011220120011 is an equidigital number, since it uses as much as digits as its factorization.
111011220120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1881546103788.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111011220120011 its reverse (110021022110111), we get a palindrome (221032242230122).
The spelling of 111011220120011 in words is "one hundred eleven trillion, eleven billion, two hundred twenty million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •