Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …0100110000110011101 |
3 | 201020011002211202012201 |
4 | 2323110102212012131 |
5 | 11243403303440221 |
6 | 232221540531501 |
7 | 20350122660664 |
oct | 2732422460635 |
9 | 636132752181 |
10 | 201130140061 |
11 | 783317a2154 |
12 | 32b920b0b91 |
13 | 15c744c37c6 |
14 | 9a40227ddb |
15 | 53727b0891 |
hex | 2ed44a619d |
201130140061 has 2 divisors, whose sum is σ = 201130140062. Its totient is φ = 201130140060.
The previous prime is 201130139891. The next prime is 201130140067. The reversal of 201130140061 is 160041031102.
201130140061 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 can be written as a sum of positive squares in only one way, i.e., 197638039225 + 3492100836 = 444565^2 + 59094^2 .
It is a cyclic number.
It is not a de Polignac number, because 201130140061 - 225 = 201096585629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201130140067) 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, 100565070030 + 100565070031.
It is an arithmetic number, because the mean of its divisors is an integer number (100565070031).
Almost surely, 2201130140061 is an apocalyptic number.
It is an amenable number.
201130140061 is a deficient number, since it is larger than the sum of its proper divisors (1).
201130140061 is an equidigital number, since it uses as much as digits as its factorization.
201130140061 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 201130140061 its reverse (160041031102), we get a palindrome (361171171163).
The spelling of 201130140061 in words is "two hundred one billion, one hundred thirty million, one hundred forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •