Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1000011101011101111 |
3 | 101122002010021002112112 |
4 | 1213211033003223233 |
5 | 3310234322041421 |
6 | 123032132554235 |
7 | 11015065232423 |
oct | 1474517035357 |
9 | 348063232475 |
10 | 111220112111 |
11 | 43193943429 |
12 | 1967b48297b |
13 | a646213834 |
14 | 555126ab83 |
15 | 2d5e2a745b |
hex | 19e53c3aef |
111220112111 has 4 divisors (see below), whose sum is σ = 111236212224. Its totient is φ = 111204012000.
The previous prime is 111220112089. The next prime is 111220112119. The reversal of 111220112111 is 111211022111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111211022111 = 7 ⋅15887288873.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111220112111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111220112119) 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 3 ways as a sum of consecutive naturals, for example, 8039690 + ... + 8053511.
It is an arithmetic number, because the mean of its divisors is an integer number (27809053056).
Almost surely, 2111220112111 is an apocalyptic number.
111220112111 is a deficient number, since it is larger than the sum of its proper divisors (16100113).
111220112111 is an equidigital number, since it uses as much as digits as its factorization.
111220112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16100112.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111220112111 its reverse (111211022111), we get a palindrome (222431134222).
The spelling of 111220112111 in words is "one hundred eleven billion, two hundred twenty million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •