Base | Representation |
---|---|
bin | 111000010110101011… |
… | …1100000001011001111 |
3 | 102120101002220011101111 |
4 | 1300231113200023033 |
5 | 3440322134020421 |
6 | 131332415152451 |
7 | 11512664620030 |
oct | 1605527401317 |
9 | 376332804344 |
10 | 121020220111 |
11 | 4736283963a |
12 | 1b555515727 |
13 | b548683bcb |
14 | 5c00a38a87 |
15 | 323482cee1 |
hex | 1c2d5e02cf |
121020220111 has 8 divisors (see below), whose sum is σ = 145588234880. Its totient is φ = 98272058328.
The previous prime is 121020220099. The next prime is 121020220117. The reversal of 121020220111 is 111022020121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121020220111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121020220091 and 121020220100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121020220117) 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, 454963101 + ... + 454963366.
It is an arithmetic number, because the mean of its divisors is an integer number (18198529360).
Almost surely, 2121020220111 is an apocalyptic number.
121020220111 is a deficient number, since it is larger than the sum of its proper divisors (24568014769).
121020220111 is an equidigital number, since it uses as much as digits as its factorization.
121020220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909926493.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121020220111 its reverse (111022020121), we get a palindrome (232042240232).
The spelling of 121020220111 in words is "one hundred twenty-one billion, twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •