Base | Representation |
---|---|
bin | 110000001101001010101110… |
… | …011000000100100110000001 |
3 | 1000210200001201011121010000011 |
4 | 300031022232120010212001 |
5 | 210242042213402223014 |
6 | 2030524315541024521 |
7 | 62441203505140642 |
oct | 6015125630044601 |
9 | 1023601634533004 |
10 | 212011101211009 |
11 | 6160a448574301 |
12 | 1b9412089b5141 |
13 | 913b73a851b79 |
14 | 3a4d56badb6c9 |
15 | 1979d668927c4 |
hex | c0d2ae604981 |
212011101211009 has 4 divisors (see below), whose sum is σ = 212038818711300. Its totient is φ = 211983383710720.
The previous prime is 212011101210971. The next prime is 212011101211037. The reversal of 212011101211009 is 900112101110212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36145310337409 + 175865790873600 = 6012097^2 + 13261440^2 .
It is a cyclic number.
It is not a de Polignac number, because 212011101211009 - 217 = 212011101079937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212011101211909) 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, 13858738672 + ... + 13858753969.
It is an arithmetic number, because the mean of its divisors is an integer number (53009704677825).
Almost surely, 2212011101211009 is an apocalyptic number.
It is an amenable number.
212011101211009 is a deficient number, since it is larger than the sum of its proper divisors (27717500291).
212011101211009 is an equidigital number, since it uses as much as digits as its factorization.
212011101211009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27717500290.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 212011101211009 in words is "two hundred twelve trillion, eleven billion, one hundred one million, two hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •