Base | Representation |
---|---|
bin | 11011100010011000101011… |
… | …000110110100110110001101 |
3 | 120212211000121211200110212101 |
4 | 123202120223012310312031 |
5 | 111333232203010202341 |
6 | 1105325132440035101 |
7 | 34336631634155611 |
oct | 3342305306646615 |
9 | 525730554613771 |
10 | 121110211022221 |
11 | 35653608870343 |
12 | 116bbb78762a91 |
13 | 527684a838615 |
14 | 21c9aa070b341 |
15 | e0054b799831 |
hex | 6e262b1b4d8d |
121110211022221 has 8 divisors (see below), whose sum is σ = 121258516636224. Its totient is φ = 120961908197760.
The previous prime is 121110211022189. The next prime is 121110211022287. The reversal of 121110211022221 is 122220112011121.
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 121110211022221 - 25 = 121110211022189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121110211052221) 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, 94060701 + ... + 95339581.
It is an arithmetic number, because the mean of its divisors is an integer number (15157314579528).
Almost surely, 2121110211022221 is an apocalyptic number.
It is an amenable number.
121110211022221 is a deficient number, since it is larger than the sum of its proper divisors (148305614003).
121110211022221 is a wasteful number, since it uses less digits than its factorization.
121110211022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1394771.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121110211022221 its reverse (122220112011121), we get a palindrome (243330323033342).
The spelling of 121110211022221 in words is "one hundred twenty-one trillion, one hundred ten billion, two hundred eleven million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •