Base | Representation |
---|---|
bin | 110011101111101100… |
… | …1100011010111001011 |
3 | 101121211022000122101110 |
4 | 1213133121203113023 |
5 | 3310034240400021 |
6 | 123014314221403 |
7 | 11012466054414 |
oct | 1473731432713 |
9 | 347738018343 |
10 | 111122200011 |
11 | 43143648639 |
12 | 19652724863 |
13 | a62bb51494 |
14 | 554226080b |
15 | 2d558b6476 |
hex | 19df6635cb |
111122200011 has 8 divisors (see below), whose sum is σ = 152167337104. Its totient is φ = 72079264800.
The previous prime is 111122199889. The next prime is 111122200019. The reversal of 111122200011 is 110002221111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111122200011 - 221 = 111120102859 is a prime.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 111122200011.
It is not an unprimeable number, because it can be changed into a prime (111122200019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500550340 + ... + 500550561.
It is an arithmetic number, because the mean of its divisors is an integer number (19020917138).
Almost surely, 2111122200011 is an apocalyptic number.
111122200011 is a deficient number, since it is larger than the sum of its proper divisors (41045137093).
111122200011 is a wasteful number, since it uses less digits than its factorization.
111122200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001100941.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111122200011 its reverse (110002221111), we get a palindrome (221124421122).
The spelling of 111122200011 in words is "one hundred eleven billion, one hundred twenty-two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •