Base | Representation |
---|---|
bin | 1100010110001000110… |
… | …1100100000001101111 |
3 | 202021110200200021120011 |
4 | 3011202031210001233 |
5 | 11433340341320421 |
6 | 241234331034051 |
7 | 21216030526366 |
oct | 3054215440157 |
9 | 667420607504 |
10 | 212101120111 |
11 | 81a51609911 |
12 | 3513429b927 |
13 | 170023ca28a |
14 | a3a13027dd |
15 | 57b5a1b4e1 |
hex | 316236406f |
212101120111 has 8 divisors (see below), whose sum is σ = 212216838480. Its totient is φ = 211985440128.
The previous prime is 212101120079. The next prime is 212101120139. The reversal of 212101120111 is 111021101212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212101120111 - 25 = 212101120079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212101120091 and 212101120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212101120171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24462285 + ... + 24470953.
It is an arithmetic number, because the mean of its divisors is an integer number (26527104810).
Almost surely, 2212101120111 is an apocalyptic number.
212101120111 is a deficient number, since it is larger than the sum of its proper divisors (115718369).
212101120111 is an equidigital number, since it uses as much as digits as its factorization.
212101120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19193.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212101120111 its reverse (111021101212), we get a palindrome (323122221323).
The spelling of 212101120111 in words is "two hundred twelve billion, one hundred one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •