Base | Representation |
---|---|
bin | 110000001101010100001001… |
… | …000010001000101110011011 |
3 | 1000210201000210211001121102102 |
4 | 300031110021002020232123 |
5 | 210242223420300401021 |
6 | 2030533111124554015 |
7 | 62442012200360405 |
oct | 6015241102105633 |
9 | 1023630724047372 |
10 | 212021212122011 |
11 | 616137669523a6 |
12 | 1b94316ab5290b |
13 | 913c68c503246 |
14 | 3a4dc4a891b75 |
15 | 197a25935d00b |
hex | c0d509088b9b |
212021212122011 has 4 divisors (see below), whose sum is σ = 212021651720352. Its totient is φ = 212020772523672.
The previous prime is 212021212121993. The next prime is 212021212122053. The reversal of 212021212122011 is 110221212120212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212021212122011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212021212122091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219074915 + ... + 220040588.
It is an arithmetic number, because the mean of its divisors is an integer number (53005412930088).
Almost surely, 2212021212122011 is an apocalyptic number.
212021212122011 is a deficient number, since it is larger than the sum of its proper divisors (439598341).
212021212122011 is an equidigital number, since it uses as much as digits as its factorization.
212021212122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439598340.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 212021212122011 its reverse (110221212120212), we get a palindrome (322242424242223).
The spelling of 212021212122011 in words is "two hundred twelve trillion, twenty-one billion, two hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •