Base | Representation |
---|---|
bin | 1011101101001101001… |
… | …0000001100101101011 |
3 | 201020002220222210001022 |
4 | 2323103102001211223 |
5 | 11243334440311131 |
6 | 232220134043055 |
7 | 20346526051544 |
oct | 2732322014553 |
9 | 636086883038 |
10 | 201113213291 |
11 | 78323190891 |
12 | 32b884a948b |
13 | 15c70b48173 |
14 | 9a3bc9d4cb |
15 | 537106a37b |
hex | 2ed348196b |
201113213291 has 2 divisors, whose sum is σ = 201113213292. Its totient is φ = 201113213290.
The previous prime is 201113213267. The next prime is 201113213309. The reversal of 201113213291 is 192312311102.
201113213291 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201113213291 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201113213291.
It is not a weakly prime, because it can be changed into another prime (201113213491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100556606645 + 100556606646.
It is an arithmetic number, because the mean of its divisors is an integer number (100556606646).
Almost surely, 2201113213291 is an apocalyptic number.
201113213291 is a deficient number, since it is larger than the sum of its proper divisors (1).
201113213291 is an equidigital number, since it uses as much as digits as its factorization.
201113213291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
Adding to 201113213291 its reverse (192312311102), we get a palindrome (393425524393).
The spelling of 201113213291 in words is "two hundred one billion, one hundred thirteen million, two hundred thirteen thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •