Base | Representation |
---|---|
bin | 11011100011110101100111… |
… | …000111111111110110100011 |
3 | 120220011120012110102001212221 |
4 | 123203311213013333312203 |
5 | 111341401041031211321 |
6 | 1105443034543331511 |
7 | 34350063564236005 |
oct | 3343654707776643 |
9 | 526146173361787 |
10 | 121210002210211 |
11 | 35691967344932 |
12 | 117173885b0b97 |
13 | 5283091cc6b55 |
14 | 21d0849b34375 |
15 | e02e3c4d8e41 |
hex | 6e3d671ffda3 |
121210002210211 has 4 divisors (see below), whose sum is σ = 121210102081312. Its totient is φ = 121209902339112.
The previous prime is 121210002210151. The next prime is 121210002210223. The reversal of 121210002210211 is 112012200012121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121210002210211 - 225 = 121209968655779 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121210002210281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48092376 + ... + 50549941.
It is an arithmetic number, because the mean of its divisors is an integer number (30302525520328).
Almost surely, 2121210002210211 is an apocalyptic number.
121210002210211 is a deficient number, since it is larger than the sum of its proper divisors (99871101).
121210002210211 is an equidigital number, since it uses as much as digits as its factorization.
121210002210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99871100.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121210002210211 its reverse (112012200012121), we get a palindrome (233222202222332).
The spelling of 121210002210211 in words is "one hundred twenty-one trillion, two hundred ten billion, two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •