Base | Representation |
---|---|
bin | 111000110111001100… |
… | …1101001001000001111 |
3 | 102200012010221202202212 |
4 | 1301232121221020033 |
5 | 4000040443100421 |
6 | 132032552541035 |
7 | 11552013632213 |
oct | 1615631511017 |
9 | 380163852685 |
10 | 122111300111 |
11 | 47872711149 |
12 | 1b7ba9b177b |
13 | b690730788 |
14 | 5ca58d4943 |
15 | 329a500e5b |
hex | 1c6e66920f |
122111300111 has 8 divisors (see below), whose sum is σ = 124966050000. Its totient is φ = 119257229952.
The previous prime is 122111300083. The next prime is 122111300117. The reversal of 122111300111 is 111003111221.
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 122111300111 - 218 = 122111037967 is a prime.
It is a super-2 number, since 2×1221113001112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111300117) 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 7 ways as a sum of consecutive naturals, for example, 203015 + ... + 534263.
It is an arithmetic number, because the mean of its divisors is an integer number (15620756250).
Almost surely, 2122111300111 is an apocalyptic number.
122111300111 is a deficient number, since it is larger than the sum of its proper divisors (2854749889).
122111300111 is an equidigital number, since it uses as much as digits as its factorization.
122111300111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339865.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 122111300111 its reverse (111003111221), we get a palindrome (233114411332).
The spelling of 122111300111 in words is "one hundred twenty-two billion, one hundred eleven million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •