Base | Representation |
---|---|
bin | 111000010110011100… |
… | …0111100111001111001 |
3 | 102120100112211021101122 |
4 | 1300230320330321321 |
5 | 3440313111230241 |
6 | 131331531355025 |
7 | 11512536552551 |
oct | 1605470747171 |
9 | 376315737348 |
10 | 121012211321 |
11 | 47359269501 |
12 | 1b5528b2a75 |
13 | b546b0b791 |
14 | 5bdd952161 |
15 | 3233c9a04b |
hex | 1c2ce3ce79 |
121012211321 has 4 divisors (see below), whose sum is σ = 121439816592. Its totient is φ = 120584606052.
The previous prime is 121012211303. The next prime is 121012211357. The reversal of 121012211321 is 123112210121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121012211321 - 234 = 103832342137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121012211321.
It is not an unprimeable number, because it can be changed into a prime (121012211371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213802211 + ... + 213802776.
It is an arithmetic number, because the mean of its divisors is an integer number (30359954148).
Almost surely, 2121012211321 is an apocalyptic number.
It is an amenable number.
121012211321 is a deficient number, since it is larger than the sum of its proper divisors (427605271).
121012211321 is an equidigital number, since it uses as much as digits as its factorization.
121012211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427605270.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 121012211321 its reverse (123112210121), we get a palindrome (244124421442).
The spelling of 121012211321 in words is "one hundred twenty-one billion, twelve million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •