Base | Representation |
---|---|
bin | 110000001111111010101111… |
… | …101001000011101111100011 |
3 | 1000211100010112220001021211220 |
4 | 300033322233221003233203 |
5 | 210303141301324032321 |
6 | 2031151214114310123 |
7 | 62460644214642240 |
oct | 6017725751035743 |
9 | 1024303486037756 |
10 | 212200101002211 |
11 | 61682614a74853 |
12 | 1b971974588343 |
13 | 91534caba264a |
14 | 3a5877ac965c7 |
15 | 197ec292359c6 |
hex | c0feafa43be3 |
212200101002211 has 32 divisors (see below), whose sum is σ = 344264837349888. Its totient is φ = 113493902353920.
The previous prime is 212200101002207. The next prime is 212200101002233. The reversal of 212200101002211 is 112200101002212.
It is not a de Polignac number, because 212200101002211 - 22 = 212200101002207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212200101000211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1641918925 + ... + 1642048158.
It is an arithmetic number, because the mean of its divisors is an integer number (10758276167184).
Almost surely, 2212200101002211 is an apocalyptic number.
212200101002211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
212200101002211 is a deficient number, since it is larger than the sum of its proper divisors (132064736347677).
212200101002211 is a wasteful number, since it uses less digits than its factorization.
212200101002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3283967291.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 212200101002211 its reverse (112200101002212), we get a palindrome (324400202004423).
Subtracting from 212200101002211 its reverse (112200101002212), we obtain a palindrome (99999999999999).
The spelling of 212200101002211 in words is "two hundred twelve trillion, two hundred billion, one hundred one million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •