Base | Representation |
---|---|
bin | 1100010110001000110… |
… | …1111010001111011101 |
3 | 202021110200211220101011 |
4 | 3011202031322033131 |
5 | 11433340402223401 |
6 | 241234333015221 |
7 | 21216031355563 |
oct | 3054215721735 |
9 | 667420756334 |
10 | 212101211101 |
11 | 81a5167120a |
12 | 35134324511 |
13 | 1700242c810 |
14 | a3a1327a33 |
15 | 57b5a38451 |
hex | 316237a3dd |
212101211101 has 24 divisors (see below), whose sum is σ = 239378211576. Its totient is φ = 186803865600.
The previous prime is 212101211099. The next prime is 212101211131. The reversal of 212101211101 is 101112101212.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 69595716100 + 142505495001 = 263810^2 + 377499^2 .
It is not a de Polignac number, because 212101211101 - 21 = 212101211099 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (212101211131) 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, 2719221 + ... + 2796133.
It is an arithmetic number, because the mean of its divisors is an integer number (9974092149).
Almost surely, 2212101211101 is an apocalyptic number.
It is an amenable number.
212101211101 is a deficient number, since it is larger than the sum of its proper divisors (27277000475).
212101211101 is a wasteful number, since it uses less digits than its factorization.
212101211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77373 (or 77350 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212101211101 its reverse (101112101212), we get a palindrome (313213312313).
The spelling of 212101211101 in words is "two hundred twelve billion, one hundred one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •