Base | Representation |
---|---|
bin | 101101101111111111100010… |
… | …001110000101100001111101 |
3 | 222101102111111210110001012212 |
4 | 231233333202032011201331 |
5 | 202333111320313243242 |
6 | 1551534353513510205 |
7 | 60244644356643161 |
oct | 5557774216054175 |
9 | 871374453401185 |
10 | 201210128259197 |
11 | 59125810957492 |
12 | 1a697a54a12365 |
13 | 8837058cc0365 |
14 | 379889d33aca1 |
15 | 183de0d020782 |
hex | b6ffe238587d |
201210128259197 has 2 divisors, whose sum is σ = 201210128259198. Its totient is φ = 201210128259196.
The previous prime is 201210128259143. The next prime is 201210128259223. The reversal of 201210128259197 is 791952821012102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113742630270361 + 87467497988836 = 10665019^2 + 9352406^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201210128259197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201210128219197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605064129598 + 100605064129599.
It is an arithmetic number, because the mean of its divisors is an integer number (100605064129599).
Almost surely, 2201210128259197 is an apocalyptic number.
It is an amenable number.
201210128259197 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210128259197 is an equidigital number, since it uses as much as digits as its factorization.
201210128259197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 50.
The spelling of 201210128259197 in words is "two hundred one trillion, two hundred ten billion, one hundred twenty-eight million, two hundred fifty-nine thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •