Base | Representation |
---|---|
bin | 11011100000111100011110… |
… | …110010110110010110100111 |
3 | 120212110120010000000020111222 |
4 | 123200330132302312112213 |
5 | 111330121434333223421 |
6 | 1105211442003250555 |
7 | 34326525563152016 |
oct | 3340743662662647 |
9 | 525416100006458 |
10 | 121011220211111 |
11 | 3561563006484a |
12 | 116a4950979a5b |
13 | 526a403132689 |
14 | 21c4d8d70aa7d |
15 | decba5e58cab |
hex | 6e0f1ecb65a7 |
121011220211111 has 16 divisors (see below), whose sum is σ = 122651951145600. Its totient is φ = 119373224256000.
The previous prime is 121011220211087. The next prime is 121011220211143. The reversal of 121011220211111 is 111112022110121.
It is a cyclic number.
It is not a de Polignac number, because 121011220211111 - 210 = 121011220210087 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121011220211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011220214111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3038859581 + ... + 3038899401.
It is an arithmetic number, because the mean of its divisors is an integer number (7665746946600).
Almost surely, 2121011220211111 is an apocalyptic number.
121011220211111 is a deficient number, since it is larger than the sum of its proper divisors (1640730934489).
121011220211111 is a wasteful number, since it uses less digits than its factorization.
121011220211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73130.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 121011220211111 its reverse (111112022110121), we get a palindrome (232123242321232).
The spelling of 121011220211111 in words is "one hundred twenty-one trillion, eleven billion, two hundred twenty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.432 sec. • engine limits •