Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0100111011100111101 |
3 | 201012211210220112010221 |
4 | 2323031030213130331 |
5 | 11243132322212341 |
6 | 232202050101341 |
7 | 20344146301234 |
oct | 2731514473475 |
9 | 635753815127 |
10 | 201011132221 |
11 | 782805a8869 |
12 | 32b5a27a851 |
13 | 15c55956373 |
14 | 9a2c4c9b1b |
15 | 5367103ed1 |
hex | 2ecd32773d |
201011132221 has 2 divisors, whose sum is σ = 201011132222. Its totient is φ = 201011132220.
The previous prime is 201011132173. The next prime is 201011132227. The reversal of 201011132221 is 122231110102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 191008332025 + 10002800196 = 437045^2 + 100014^2 .
It is a cyclic number.
It is not a de Polignac number, because 201011132221 - 27 = 201011132093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201011132195 and 201011132204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201011132227) 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 as a sum of consecutive naturals, namely, 100505566110 + 100505566111.
It is an arithmetic number, because the mean of its divisors is an integer number (100505566111).
Almost surely, 2201011132221 is an apocalyptic number.
It is an amenable number.
201011132221 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011132221 is an equidigital number, since it uses as much as digits as its factorization.
201011132221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 201011132221 its reverse (122231110102), we get a palindrome (323242242323).
The spelling of 201011132221 in words is "two hundred one billion, eleven million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •