Base | Representation |
---|---|
bin | 1011101101010001101… |
… | …0011111110000001101 |
3 | 201020011020201222022001 |
4 | 2323110122133300031 |
5 | 11243404321224323 |
6 | 232222053152301 |
7 | 20350146405223 |
oct | 2732432376015 |
9 | 636136658261 |
10 | 201132211213 |
11 | 7833298724a |
12 | 32b9292b691 |
13 | 15c74a6a43b |
14 | 9a40606b13 |
15 | 5372a6e3ad |
hex | 2ed469fc0d |
201132211213 has 2 divisors, whose sum is σ = 201132211214. Its totient is φ = 201132211212.
The previous prime is 201132211187. The next prime is 201132211229. The reversal of 201132211213 is 312112231102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 179859113604 + 21273097609 = 424098^2 + 145853^2 .
It is a cyclic number.
It is not a de Polignac number, because 201132211213 - 221 = 201130114061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201132215213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100566105606 + 100566105607.
It is an arithmetic number, because the mean of its divisors is an integer number (100566105607).
Almost surely, 2201132211213 is an apocalyptic number.
It is an amenable number.
201132211213 is a deficient number, since it is larger than the sum of its proper divisors (1).
201132211213 is an equidigital number, since it uses as much as digits as its factorization.
201132211213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 201132211213 its reverse (312112231102), we get a palindrome (513244442315).
The spelling of 201132211213 in words is "two hundred one billion, one hundred thirty-two million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •