Base | Representation |
---|---|
bin | 11001001100011… |
… | …11101000100101 |
3 | 112201200210120121 |
4 | 30212033220211 |
5 | 413101231401 |
6 | 32550001541 |
7 | 5144314612 |
oct | 1446175045 |
9 | 481623517 |
10 | 211352101 |
11 | a9336a64 |
12 | 5a9462b1 |
13 | 34a3041c |
14 | 200d9509 |
15 | 1384cca1 |
hex | c98fa25 |
211352101 has 4 divisors (see below), whose sum is σ = 214934400. Its totient is φ = 207769804.
The previous prime is 211352093. The next prime is 211352117. The reversal of 211352101 is 101253112.
211352101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 211352101 - 23 = 211352093 is a prime.
It is a super-2 number, since 2×2113521012 = 89339421194228402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211350101) 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, 1791061 + ... + 1791178.
It is an arithmetic number, because the mean of its divisors is an integer number (53733600).
Almost surely, 2211352101 is an apocalyptic number.
It is an amenable number.
211352101 is a deficient number, since it is larger than the sum of its proper divisors (3582299).
211352101 is an equidigital number, since it uses as much as digits as its factorization.
211352101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3582298.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 211352101 is about 14537.9538106296. The cubic root of 211352101 is about 595.6651469860.
The spelling of 211352101 in words is "two hundred eleven million, three hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.999 sec. • engine limits •