Base | Representation |
---|---|
bin | 11011100001000101100110… |
… | …011100010111011000010101 |
3 | 120212111111101102101101102201 |
4 | 123201011212130113120111 |
5 | 111330302013111224341 |
6 | 1105220141400004501 |
7 | 34330323333610213 |
oct | 3341054634273025 |
9 | 525444342341381 |
10 | 121021012211221 |
11 | 356197a5422421 |
12 | 116a6824160731 |
13 | 526b3039c4495 |
14 | 21c563bda7cb3 |
15 | ded07a92c331 |
hex | 6e1166717615 |
121021012211221 has 16 divisors (see below), whose sum is σ = 124200534110400. Its totient is φ = 117858540780288.
The previous prime is 121021012211201. The next prime is 121021012211243. The reversal of 121021012211221 is 122112210120121.
It is a happy number.
It is not a de Polignac number, because 121021012211221 - 237 = 120883573257749 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 (121021012211201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19589725 + ... + 25015981.
It is an arithmetic number, because the mean of its divisors is an integer number (7762533381900).
Almost surely, 2121021012211221 is an apocalyptic number.
It is an amenable number.
121021012211221 is a deficient number, since it is larger than the sum of its proper divisors (3179521899179).
121021012211221 is a wasteful number, since it uses less digits than its factorization.
121021012211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5427828.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121021012211221 its reverse (122112210120121), we get a palindrome (243133222331342).
The spelling of 121021012211221 in words is "one hundred twenty-one trillion, twenty-one billion, twelve million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •