Base | Representation |
---|---|
bin | 110000001101000001100000… |
… | …001101111101010000111111 |
3 | 1000210122010011010201120210111 |
4 | 300031001200031331100333 |
5 | 210241411424200031421 |
6 | 2030520001243450451 |
7 | 62440403240224462 |
oct | 6015014015752077 |
9 | 1023563133646714 |
10 | 212001200002111 |
11 | 616062275a5533 |
12 | 1b93b304b26a27 |
13 | 913a820473b90 |
14 | 3a4ccacb332d9 |
15 | 19799874eaee1 |
hex | c0d06037d43f |
212001200002111 has 16 divisors (see below), whose sum is σ = 228389921858560. Its totient is φ = 195624044460000.
The previous prime is 212001200002087. The next prime is 212001200002121. The reversal of 212001200002111 is 111200002100212.
It is not a de Polignac number, because 212001200002111 - 217 = 212001199871039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212001200002091 and 212001200002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212001200002121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1951301956 + ... + 1951410598.
It is an arithmetic number, because the mean of its divisors is an integer number (14274370116160).
Almost surely, 2212001200002111 is an apocalyptic number.
212001200002111 is a deficient number, since it is larger than the sum of its proper divisors (16388721856449).
212001200002111 is a wasteful number, since it uses less digits than its factorization.
212001200002111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160486.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212001200002111 its reverse (111200002100212), we get a palindrome (323201202102323).
The spelling of 212001200002111 in words is "two hundred twelve trillion, one billion, two hundred million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •