Base | Representation |
---|---|
bin | 1100010110001011001… |
… | …1101000100001100001 |
3 | 202021111101110022101201 |
4 | 3011202303220201201 |
5 | 11433400420200001 |
6 | 241235325001201 |
7 | 21216211413313 |
oct | 3054263504141 |
9 | 667441408351 |
10 | 212111100001 |
11 | 81a57205959 |
12 | 351376b3201 |
13 | 170044b2938 |
14 | a3a277d7b3 |
15 | 57b683d501 |
hex | 3162ce8861 |
212111100001 has 4 divisors (see below), whose sum is σ = 214211210004. Its totient is φ = 210010990000.
The previous prime is 212111099933. The next prime is 212111100023. The reversal of 212111100001 is 100001111212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 157866360976 + 54244739025 = 397324^2 + 232905^2 .
It is a cyclic number.
It is not a de Polignac number, because 212111100001 - 225 = 212077545569 is a prime.
It is a super-2 number, since 2×2121111000012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212111100041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1050054850 + ... + 1050055051.
It is an arithmetic number, because the mean of its divisors is an integer number (53552802501).
Almost surely, 2212111100001 is an apocalyptic number.
It is an amenable number.
212111100001 is a deficient number, since it is larger than the sum of its proper divisors (2100110003).
212111100001 is a wasteful number, since it uses less digits than its factorization.
212111100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2100110002.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 212111100001 its reverse (100001111212), we get a palindrome (312112211213).
The spelling of 212111100001 in words is "two hundred twelve billion, one hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •