Base | Representation |
---|---|
bin | 110011101111101100… |
… | …0110101110001111111 |
3 | 101121211021200011021122 |
4 | 1213133120311301333 |
5 | 3310034213411221 |
6 | 123014310221155 |
7 | 11012464346201 |
oct | 1473730656177 |
9 | 347737604248 |
10 | 111122013311 |
11 | 43143530341 |
12 | 196526547bb |
13 | a62bab74ca |
14 | 5542212771 |
15 | 2d5587aeab |
hex | 19df635c7f |
111122013311 has 8 divisors (see below), whose sum is σ = 111964438320. Its totient is φ = 110282337792.
The previous prime is 111122013307. The next prime is 111122013319. The reversal of 111122013311 is 113310221111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111122013311 - 22 = 111122013307 is a prime.
It is a super-2 number, since 2×1111220133112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111122013311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111122013319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 606200 + ... + 767933.
It is an arithmetic number, because the mean of its divisors is an integer number (13995554790).
Almost surely, 2111122013311 is an apocalyptic number.
111122013311 is a deficient number, since it is larger than the sum of its proper divisors (842425009).
111122013311 is a wasteful number, since it uses less digits than its factorization.
111122013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374745.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 111122013311 its reverse (113310221111), we get a palindrome (224432234422).
The spelling of 111122013311 in words is "one hundred eleven billion, one hundred twenty-two million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •