Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …000111101101100010111001 |
3 | 120212211010011211201011020120 |
4 | 123202121212013231202321 |
5 | 111333241214441011301 |
6 | 1105325415005043453 |
7 | 34336665315604521 |
oct | 3342314607554271 |
9 | 525733154634216 |
10 | 121111201110201 |
11 | 35653a76734075 |
12 | 117001b4256589 |
13 | 52769779b4cb3 |
14 | 21c9b55dd8681 |
15 | e005a866de36 |
hex | 6e26661ed8b9 |
121111201110201 has 8 divisors (see below), whose sum is σ = 161693798068704. Its totient is φ = 80634702445920.
The previous prime is 121111201110199. The next prime is 121111201110247. The reversal of 121111201110201 is 102011102111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121111201110201 - 21 = 121111201110199 is a prime.
It is a super-3 number, since 3×1211112011102013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121111201110281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26524570891 + ... + 26524575456.
It is an arithmetic number, because the mean of its divisors is an integer number (20211724758588).
Almost surely, 2121111201110201 is an apocalyptic number.
It is an amenable number.
121111201110201 is a deficient number, since it is larger than the sum of its proper divisors (40582596958503).
121111201110201 is an equidigital number, since it uses as much as digits as its factorization.
121111201110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53049147111.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 121111201110201 its reverse (102011102111121), we get a palindrome (223122303221322).
The spelling of 121111201110201 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred one million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •