Base | Representation |
---|---|
bin | 1100010010000111000… |
… | …1110101100100010101 |
3 | 202011200100120021121101 |
4 | 3010201301311210111 |
5 | 11424132122010401 |
6 | 240535153150101 |
7 | 21150163224613 |
oct | 3044161654425 |
9 | 664610507541 |
10 | 211020110101 |
11 | 81547395009 |
12 | 34a9225b331 |
13 | 16b8c468098 |
14 | a2db9086b3 |
15 | 5750b87101 |
hex | 3121c75915 |
211020110101 has 8 divisors (see below), whose sum is σ = 223557150744. Its totient is φ = 198496857600.
The previous prime is 211020110089. The next prime is 211020110111. The reversal of 211020110101 is 101011020112.
It can be written as a sum of positive squares in 4 ways, for example, as 21977766001 + 189042344100 = 148249^2 + 434790^2 .
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 211020110101 - 25 = 211020110069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211020110111) 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, 3415510 + ... + 3476743.
It is an arithmetic number, because the mean of its divisors is an integer number (27944643843).
Almost surely, 2211020110101 is an apocalyptic number.
It is an amenable number.
211020110101 is a deficient number, since it is larger than the sum of its proper divisors (12537040643).
211020110101 is a wasteful number, since it uses less digits than its factorization.
211020110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6894071.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211020110101 its reverse (101011020112), we get a palindrome (312031130213).
The spelling of 211020110101 in words is "two hundred eleven billion, twenty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •