Base | Representation |
---|---|
bin | 1011101101100100001… |
… | …1010010000110011101 |
3 | 201020100200010122222221 |
4 | 2323121003102012131 |
5 | 11244034230341221 |
6 | 232233512505341 |
7 | 20352112611652 |
oct | 2733103220635 |
9 | 636320118887 |
10 | 201210012061 |
11 | 78372896173 |
12 | 32bb49ab251 |
13 | 15c87c0a846 |
14 | 9a4aa99c29 |
15 | 53797db541 |
hex | 2ed90d219d |
201210012061 has 2 divisors, whose sum is σ = 201210012062. Its totient is φ = 201210012060.
The previous prime is 201210012049. The next prime is 201210012167. The reversal of 201210012061 is 160210012102.
201210012061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126402291961 + 74807720100 = 355531^2 + 273510^2 .
It is a cyclic number.
It is not a de Polignac number, because 201210012061 - 215 = 201209979293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201210052061) 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, 100605006030 + 100605006031.
It is an arithmetic number, because the mean of its divisors is an integer number (100605006031).
Almost surely, 2201210012061 is an apocalyptic number.
It is an amenable number.
201210012061 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210012061 is an equidigital number, since it uses as much as digits as its factorization.
201210012061 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 201210012061 its reverse (160210012102), we get a palindrome (361420024163).
The spelling of 201210012061 in words is "two hundred one billion, two hundred ten million, twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •