Base | Representation |
---|---|
bin | 1100010011001111001… |
… | …0001110011111110111 |
3 | 202012110102000010221001 |
4 | 3010303302032133313 |
5 | 11430241440431403 |
6 | 241025144104131 |
7 | 21160522036405 |
oct | 3046362163767 |
9 | 665412003831 |
10 | 211322202103 |
11 | 81691968221 |
12 | 34b57465047 |
13 | 16c09c1914c |
14 | a329aa4475 |
15 | 576c45ac1d |
hex | 3133c8e7f7 |
211322202103 has 4 divisors (see below), whose sum is σ = 211343452600. Its totient is φ = 211300951608.
The previous prime is 211322202071. The next prime is 211322202121. The reversal of 211322202103 is 301202223112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211322202103 - 25 = 211322202071 is a prime.
It is a super-2 number, since 2×2113222021032 (a number of 23 digits) 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 (211322202163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10610325 + ... + 10630222.
It is an arithmetic number, because the mean of its divisors is an integer number (52835863150).
Almost surely, 2211322202103 is an apocalyptic number.
211322202103 is a deficient number, since it is larger than the sum of its proper divisors (21250497).
211322202103 is an equidigital number, since it uses as much as digits as its factorization.
211322202103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21250496.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 211322202103 its reverse (301202223112), we get a palindrome (512524425215).
The spelling of 211322202103 in words is "two hundred eleven billion, three hundred twenty-two million, two hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •