Base | Representation |
---|---|
bin | 1100010011001001110… |
… | …1111101101101000101 |
3 | 202012101212102220200022 |
4 | 3010302131331231011 |
5 | 11430220312110341 |
6 | 241023034424525 |
7 | 21160133220341 |
oct | 3046235755505 |
9 | 665355386608 |
10 | 211300113221 |
11 | 8168045054a |
12 | 34b4bb92145 |
13 | 16c05483cc2 |
14 | a326b94621 |
15 | 576a545e4b |
hex | 313277db45 |
211300113221 has 2 divisors, whose sum is σ = 211300113222. Its totient is φ = 211300113220.
The previous prime is 211300113169. The next prime is 211300113257. The reversal of 211300113221 is 122311003112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208154025121 + 3146088100 = 456239^2 + 56090^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211300113221 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 211300113221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211300113821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105650056610 + 105650056611.
It is an arithmetic number, because the mean of its divisors is an integer number (105650056611).
Almost surely, 2211300113221 is an apocalyptic number.
It is an amenable number.
211300113221 is a deficient number, since it is larger than the sum of its proper divisors (1).
211300113221 is an equidigital number, since it uses as much as digits as its factorization.
211300113221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 211300113221 its reverse (122311003112), we get a palindrome (333611116333).
The spelling of 211300113221 in words is "two hundred eleven billion, three hundred million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •