Base | Representation |
---|---|
bin | 110000001110110001000101… |
… | …011101001101101111011011 |
3 | 1000211001120101220120020020021 |
4 | 300032301011131031233123 |
5 | 210300342312041214321 |
6 | 2031051014034011311 |
7 | 62452144242244111 |
oct | 6016610535155733 |
9 | 1024046356506207 |
10 | 212121010101211 |
11 | 61652019245262 |
12 | 1b95a581116b37 |
13 | 9148c051cb943 |
14 | 3a549d6b65ab1 |
15 | 197cb4a98e941 |
hex | c0ec4574dbdb |
212121010101211 has 4 divisors (see below), whose sum is σ = 212121109443832. Its totient is φ = 212120910758592.
The previous prime is 212121010101149. The next prime is 212121010101227. The reversal of 212121010101211 is 112101010121212.
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 212121010101211 - 213 = 212121010093019 is a prime.
It is a super-3 number, since 3×2121210101012113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212121010141211) 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, 46396470 + ... + 50762923.
It is an arithmetic number, because the mean of its divisors is an integer number (53030277360958).
Almost surely, 2212121010101211 is an apocalyptic number.
212121010101211 is a deficient number, since it is larger than the sum of its proper divisors (99342621).
212121010101211 is an equidigital number, since it uses as much as digits as its factorization.
212121010101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99342620.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 212121010101211 its reverse (112101010121212), we get a palindrome (324222020222423).
The spelling of 212121010101211 in words is "two hundred twelve trillion, one hundred twenty-one billion, ten million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •