Base | Representation |
---|---|
bin | 11011100001000101100110… |
… | …111110101100101001010101 |
3 | 120212111111102001022122010001 |
4 | 123201011212332230221111 |
5 | 111330302022412224341 |
6 | 1105220142320531301 |
7 | 34330323503243245 |
oct | 3341054676545125 |
9 | 525444361278101 |
10 | 121021021211221 |
11 | 356197aa50a23a |
12 | 116a6827180b31 |
13 | 526b305825b21 |
14 | 21c563d26bb25 |
15 | ded07b608d31 |
hex | 6e1166faca55 |
121021021211221 has 8 divisors (see below), whose sum is σ = 121141190836224. Its totient is φ = 120900852972240.
The previous prime is 121021021211201. The next prime is 121021021211227. The reversal of 121021021211221 is 122112120120121.
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 121021021211221 - 29 = 121021021210709 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 (121021021211227) 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, 334383660 + ... + 334745386.
It is an arithmetic number, because the mean of its divisors is an integer number (15142648854528).
Almost surely, 2121021021211221 is an apocalyptic number.
It is an amenable number.
121021021211221 is a deficient number, since it is larger than the sum of its proper divisors (120169625003).
121021021211221 is a wasteful number, since it uses less digits than its factorization.
121021021211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693011.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121021021211221 its reverse (122112120120121), we get a palindrome (243133141331342).
The spelling of 121021021211221 in words is "one hundred twenty-one trillion, twenty-one billion, twenty-one million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •