Base | Representation |
---|---|
bin | 10111111110111… |
… | …00000000000101 |
3 | 112000112221220022 |
4 | 23333130000011 |
5 | 403000213031 |
6 | 31543544525 |
7 | 4661665052 |
oct | 1377340005 |
9 | 460487808 |
10 | 201179141 |
11 | a3618959 |
12 | 5745b145 |
13 | 328aac17 |
14 | 1ca0c029 |
15 | 129dd97b |
hex | bfdc005 |
201179141 has 2 divisors, whose sum is σ = 201179142. Its totient is φ = 201179140.
The previous prime is 201179123. The next prime is 201179171. The reversal of 201179141 is 141971102.
201179141 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., 194044900 + 7134241 = 13930^2 + 2671^2 .
It is a cyclic number.
It is not a de Polignac number, because 201179141 - 218 = 200916997 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 201179141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201179171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100589570 + 100589571.
It is an arithmetic number, because the mean of its divisors is an integer number (100589571).
Almost surely, 2201179141 is an apocalyptic number.
It is an amenable number.
201179141 is a deficient number, since it is larger than the sum of its proper divisors (1).
201179141 is an equidigital number, since it uses as much as digits as its factorization.
201179141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 26.
The square root of 201179141 is about 14183.7632876469. The cubic root of 201179141 is about 585.9505728132.
The spelling of 201179141 in words is "two hundred one million, one hundred seventy-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •