Base | Representation |
---|---|
bin | 1011101101001110111… |
… | …1110011110010000101 |
3 | 201020010110200110021222 |
4 | 2323103233303302011 |
5 | 11243343440133221 |
6 | 232221013250125 |
7 | 20346652320662 |
oct | 2732357636205 |
9 | 636113613258 |
10 | 201121021061 |
11 | 78327633994 |
12 | 32b8b033945 |
13 | 15c7264cc4c |
14 | 9a3cd32a69 |
15 | 5371aad9ab |
hex | 2ed3bf3c85 |
201121021061 has 2 divisors, whose sum is σ = 201121021062. Its totient is φ = 201121021060.
The previous prime is 201121020911. The next prime is 201121021111. The reversal of 201121021061 is 160120121102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201120856225 + 164836 = 448465^2 + 406^2 .
It is a cyclic number.
It is not a de Polignac number, because 201121021061 - 214 = 201121004677 is a prime.
It is a super-2 number, since 2×2011210210612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201121021261) 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, 100560510530 + 100560510531.
It is an arithmetic number, because the mean of its divisors is an integer number (100560510531).
Almost surely, 2201121021061 is an apocalyptic number.
It is an amenable number.
201121021061 is a deficient number, since it is larger than the sum of its proper divisors (1).
201121021061 is an equidigital number, since it uses as much as digits as its factorization.
201121021061 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 17.
Adding to 201121021061 its reverse (160120121102), we get a palindrome (361241142163).
The spelling of 201121021061 in words is "two hundred one billion, one hundred twenty-one million, twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •