Base | Representation |
---|---|
bin | 11001010001000001100110… |
… | …010110010111001001010000 |
3 | 112120110002000021201111011121 |
4 | 121101001212112113021100 |
5 | 104031102013410120422 |
6 | 1032200200023452024 |
7 | 32256143502122644 |
oct | 3121014626271120 |
9 | 476402007644147 |
10 | 111121111020112 |
11 | 32452220282046 |
12 | 105680232b7014 |
13 | 4a008a2992cbb |
14 | 1d6240d09ac24 |
15 | cca7ad7408c7 |
hex | 651066597250 |
111121111020112 has 20 divisors (see below), whose sum is σ = 215297359563636. Its totient is φ = 55560502100480.
The previous prime is 111121111020089. The next prime is 111121111020119. The reversal of 111121111020112 is 211020111121111.
It can be written as a sum of positive squares in 2 ways, for example, as 72454552576576 + 38666558443536 = 8512024^2 + 6218244^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111121111020119) 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, 17934312 + ... + 23321272.
Almost surely, 2111121111020112 is an apocalyptic number.
It is an amenable number.
111121111020112 is a deficient number, since it is larger than the sum of its proper divisors (104176248543524).
111121111020112 is a wasteful number, since it uses less digits than its factorization.
111121111020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6676206 (or 6676200 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 111121111020112 its reverse (211020111121111), we get a palindrome (322141222141223).
The spelling of 111121111020112 in words is "one hundred eleven trillion, one hundred twenty-one billion, one hundred eleven million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •