Base | Representation |
---|---|
bin | 111000011001011000… |
… | …1111000101000011111 |
3 | 102120121102202101022112 |
4 | 1300302301320220133 |
5 | 3441013410201421 |
6 | 131345421304235 |
7 | 11515146462632 |
oct | 1606261705037 |
9 | 376542671275 |
10 | 121111022111 |
11 | 473aa018512 |
12 | 1b57ba0507b |
13 | b561426bc1 |
14 | 5c0cb13c19 |
15 | 323c7b745b |
hex | 1c32c78a1f |
121111022111 has 8 divisors (see below), whose sum is σ = 121770566400. Its totient is φ = 120451743360.
The previous prime is 121111021979. The next prime is 121111022113. The reversal of 121111022111 is 111220111121.
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 121111022111 - 214 = 121111005727 is a prime.
It is a super-2 number, since 2×1211110221112 (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 (121111022113) 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, 885275 + ... + 1012883.
It is an arithmetic number, because the mean of its divisors is an integer number (15221320800).
Almost surely, 2121111022111 is an apocalyptic number.
121111022111 is a deficient number, since it is larger than the sum of its proper divisors (659544289).
121111022111 is a wasteful number, since it uses less digits than its factorization.
121111022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132769.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 121111022111 its reverse (111220111121), we get a palindrome (232331133232).
The spelling of 121111022111 in words is "one hundred twenty-one billion, one hundred eleven million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •