Base | Representation |
---|---|
bin | 101101101111010111000101… |
… | …011001011101100000010101 |
3 | 222101021100101212011022221102 |
4 | 231233113011121131200111 |
5 | 202331403342411410012 |
6 | 1551502412012555445 |
7 | 60241546143403163 |
oct | 5557270531354025 |
9 | 871240355138842 |
10 | 201166695028757 |
11 | 59109352a36617 |
12 | 1a68b553182b85 |
13 | 8832c2687b7c3 |
14 | 379673cbd2233 |
15 | 183cc19e1a2c2 |
hex | b6f5c565d815 |
201166695028757 has 2 divisors, whose sum is σ = 201166695028758. Its totient is φ = 201166695028756.
The previous prime is 201166695028669. The next prime is 201166695028801. The reversal of 201166695028757 is 757820596661102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200474619116836 + 692075911921 = 14158906^2 + 831911^2 .
It is a cyclic number.
It is not a de Polignac number, because 201166695028757 - 210 = 201166695027733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201166695028693 and 201166695028702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201166695028457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100583347514378 + 100583347514379.
It is an arithmetic number, because the mean of its divisors is an integer number (100583347514379).
Almost surely, 2201166695028757 is an apocalyptic number.
It is an amenable number.
201166695028757 is a deficient number, since it is larger than the sum of its proper divisors (1).
201166695028757 is an equidigital number, since it uses as much as digits as its factorization.
201166695028757 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 76204800, while the sum is 65.
The spelling of 201166695028757 in words is "two hundred one trillion, one hundred sixty-six billion, six hundred ninety-five million, twenty-eight thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •