Base | Representation |
---|---|
bin | 110000001101000001100000… |
… | …110100110111011110011011 |
3 | 1000210122010011211220210102120 |
4 | 300031001200310313132123 |
5 | 210241411434302431021 |
6 | 2030520002250232323 |
7 | 62440403423016006 |
oct | 6015014064673633 |
9 | 1023563154823376 |
10 | 212001210202011 |
11 | 616062323318aa |
12 | 1b93b3084256a3 |
13 | 913a822605719 |
14 | 3a4ccb022a53d |
15 | 19799883632c6 |
hex | c0d060d3779b |
212001210202011 has 16 divisors (see below), whose sum is σ = 287654441168640. Its totient is φ = 138859875387360.
The previous prime is 212001210202009. The next prime is 212001210202079. The reversal of 212001210202011 is 110202012100212.
It is not a de Polignac number, because 212001210202011 - 21 = 212001210202009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212001212202011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2351917591 + ... + 2352007728.
It is an arithmetic number, because the mean of its divisors is an integer number (17978402573040).
Almost surely, 2212001210202011 is an apocalyptic number.
212001210202011 is a deficient number, since it is larger than the sum of its proper divisors (75653230966629).
212001210202011 is a wasteful number, since it uses less digits than its factorization.
212001210202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4703925586.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 212001210202011 its reverse (110202012100212), we get a palindrome (322203222302223).
It can be divided in two parts, 212001 and 210202011, that added together give a palindrome (210414012).
The spelling of 212001210202011 in words is "two hundred twelve trillion, one billion, two hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •