Base | Representation |
---|---|
bin | 101111111110101000011011… |
… | …010110011001110100000101 |
3 | 1000200010120101011201011022201 |
4 | 233332220123112121310011 |
5 | 210124210442220011323 |
6 | 2024441400054354501 |
7 | 62306062035651400 |
oct | 5776503326316405 |
9 | 1020116334634281 |
10 | 211012202110213 |
11 | 61264855018269 |
12 | 1b7bb6b365ba31 |
13 | 909849969039a |
14 | 3a1708b988d37 |
15 | 195dda1add8ad |
hex | bfea1b599d05 |
211012202110213 has 24 divisors (see below), whose sum is σ = 251482093536960. Its totient is φ = 176443007025600.
The previous prime is 211012202110201. The next prime is 211012202110267. The reversal of 211012202110213 is 312011202210112.
It is not a de Polignac number, because 211012202110213 - 229 = 211011665239301 is a prime.
It is a super-2 number, since 2×2110122021102132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211012202410213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 60191713 + ... + 63600838.
It is an arithmetic number, because the mean of its divisors is an integer number (10478420564040).
Almost surely, 2211012202110213 is an apocalyptic number.
It is an amenable number.
211012202110213 is a deficient number, since it is larger than the sum of its proper divisors (40469891426747).
211012202110213 is a wasteful number, since it uses less digits than its factorization.
211012202110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123793417 (or 123793410 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 211012202110213 its reverse (312011202210112), we get a palindrome (523023404320325).
The spelling of 211012202110213 in words is "two hundred eleven trillion, twelve billion, two hundred two million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •