Base | Representation |
---|---|
bin | 111000011100010111… |
… | …1010100010000011001 |
3 | 102120212101220101211020 |
4 | 1300320233110100121 |
5 | 3441220004341441 |
6 | 131403352353053 |
7 | 11520502413663 |
oct | 1607057242031 |
9 | 376771811736 |
10 | 121211012121 |
11 | 47450502491 |
12 | 1b5a93a5789 |
13 | b579065ca4 |
14 | 5c1c101533 |
15 | 3246468e66 |
hex | 1c38bd4419 |
121211012121 has 8 divisors (see below), whose sum is σ = 165373164000. Its totient is φ = 78928100832.
The previous prime is 121211012053. The next prime is 121211012147. The reversal of 121211012121 is 121210112121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121211012121 - 217 = 121210881049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121211012121.
It is not an unprimeable number, because it can be changed into a prime (121211012821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 469809996 + ... + 469810253.
It is an arithmetic number, because the mean of its divisors is an integer number (20671645500).
Almost surely, 2121211012121 is an apocalyptic number.
It is an amenable number.
121211012121 is a deficient number, since it is larger than the sum of its proper divisors (44162151879).
121211012121 is an equidigital number, since it uses as much as digits as its factorization.
121211012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939620295.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121211012121 its reverse (121210112121), we get a palindrome (242421124242).
The spelling of 121211012121 in words is "one hundred twenty-one billion, two hundred eleven million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •