Base | Representation |
---|---|
bin | 110000010000000100111111… |
… | …010110100010001111101111 |
3 | 1000211101011221120100212221120 |
4 | 300100010333112202033233 |
5 | 210303331314103000421 |
6 | 2031200233500032023 |
7 | 62461513635612354 |
oct | 6020047726421757 |
9 | 1024334846325846 |
10 | 212211102000111 |
11 | 6168724a824355 |
12 | 1b973b24832613 |
13 | 9154562089266 |
14 | 3a59101d4662b |
15 | 198016ee208c6 |
hex | c1013f5a23ef |
212211102000111 has 32 divisors (see below), whose sum is σ = 284163168729600. Its totient is φ = 140867181959040.
The previous prime is 212211102000089. The next prime is 212211102000137. The reversal of 212211102000111 is 111000201112212.
It is a happy number.
212211102000111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212211102000111 - 29 = 212211101999599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212211102000311) 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, 13597166670 + ... + 13597182276.
It is an arithmetic number, because the mean of its divisors is an integer number (8880099022800).
Almost surely, 2212211102000111 is an apocalyptic number.
212211102000111 is a deficient number, since it is larger than the sum of its proper divisors (71952066729489).
212211102000111 is a wasteful number, since it uses less digits than its factorization.
212211102000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24479.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 212211102000111 its reverse (111000201112212), we get a palindrome (323211303112323).
The spelling of 212211102000111 in words is "two hundred twelve trillion, two hundred eleven billion, one hundred two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •