Base | Representation |
---|---|
bin | 111000110011111010… |
… | …1010011100001010001 |
3 | 102122220110121120220011 |
4 | 1301213311103201101 |
5 | 3444324241023441 |
6 | 132014015114521 |
7 | 11546205222421 |
oct | 1614765234121 |
9 | 378813546804 |
10 | 122001111121 |
11 | 478164a056a |
12 | 1b789b12a41 |
13 | b6739603a6 |
14 | 5c95010481 |
15 | 32909d7581 |
hex | 1c67d53851 |
122001111121 has 8 divisors (see below), whose sum is σ = 125509849920. Its totient is φ = 118537069872.
The previous prime is 122001111097. The next prime is 122001111187. The reversal of 122001111121 is 121111100221.
It is a happy number.
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 122001111121 - 219 = 122000586833 is a prime.
It is a super-2 number, since 2×1220011111212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122001111821) 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, 11168851 + ... + 11179768.
It is an arithmetic number, because the mean of its divisors is an integer number (15688731240).
Almost surely, 2122001111121 is an apocalyptic number.
It is an amenable number.
122001111121 is a deficient number, since it is larger than the sum of its proper divisors (3508738799).
122001111121 is a wasteful number, since it uses less digits than its factorization.
122001111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22348775.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 122001111121 its reverse (121111100221), we get a palindrome (243112211342).
The spelling of 122001111121 in words is "one hundred twenty-two billion, one million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •