Base | Representation |
---|---|
bin | 110000001101000001100000… |
… | …010101100101000010001011 |
3 | 1000210122010011021111002101210 |
4 | 300031001200111211002023 |
5 | 210241411430203000021 |
6 | 2030520001354344203 |
7 | 62440403263215324 |
oct | 6015014025450213 |
9 | 1023563137432353 |
10 | 212001202000011 |
11 | 6160622873a596 |
12 | 1b93b30572b063 |
13 | 913a8209c3378 |
14 | 3a4ccad0d344b |
15 | 1979987792e76 |
hex | c0d06056508b |
212001202000011 has 4 divisors (see below), whose sum is σ = 282668269333352. Its totient is φ = 141334134666672.
The previous prime is 212001202000001. The next prime is 212001202000013. The reversal of 212001202000011 is 110000202100212.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 212001202000011 - 27 = 212001201999883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212001202000013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35333533666666 + ... + 35333533666671.
It is an arithmetic number, because the mean of its divisors is an integer number (70667067333338).
Almost surely, 2212001202000011 is an apocalyptic number.
212001202000011 is a deficient number, since it is larger than the sum of its proper divisors (70667067333341).
212001202000011 is an equidigital number, since it uses as much as digits as its factorization.
212001202000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70667067333340.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212001202000011 its reverse (110000202100212), we get a palindrome (322001404100223).
The spelling of 212001202000011 in words is "two hundred twelve trillion, one billion, two hundred two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •