Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1000011001100010110 |
3 | 101122002010020222210010 |
4 | 1213211033003030112 |
5 | 3310234322010402 |
6 | 123032132541050 |
7 | 11015065223523 |
oct | 1474517031426 |
9 | 348063228703 |
10 | 111220110102 |
11 | 43193941972 |
12 | 1967b481786 |
13 | a64621294a |
14 | 555126a14a |
15 | 2d5e2a6a6c |
hex | 19e53c3316 |
111220110102 has 8 divisors (see below), whose sum is σ = 222440220216. Its totient is φ = 37073370032.
The previous prime is 111220110101. The next prime is 111220110107. The reversal of 111220110102 is 201011022111.
It is a sphenic number, since it is the product of 3 distinct primes.
111220110102 is an admirable number.
It is a super-2 number, since 2×1112201101022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111220110101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9268342503 + ... + 9268342514.
It is an arithmetic number, because the mean of its divisors is an integer number (27805027527).
Almost surely, 2111220110102 is an apocalyptic number.
111220110102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111220110102 is a wasteful number, since it uses less digits than its factorization.
111220110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18536685022.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111220110102 its reverse (201011022111), we get a palindrome (312231132213).
The spelling of 111220110102 in words is "one hundred eleven billion, two hundred twenty million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •