Search a number
-
+
101101200109957 is a prime number
BaseRepresentation
bin10110111111001101110101…
…000111100111000110000101
3111020222011212110121012101101
4112333031311013213012011
5101222420224212004312
6555005130010500101
730203214662503525
oct2677156507470605
9436864773535341
10101101200109957
112a239861839583
12b40a10b434631
134454a57753748
141ad7477837685
15ba4d1a7cda57
hex5bf3751e7185

101101200109957 has 2 divisors, whose sum is σ = 101101200109958. Its totient is φ = 101101200109956.

The previous prime is 101101200109919. The next prime is 101101200109981. The reversal of 101101200109957 is 759901002101101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94139786984356 + 6961413125601 = 9702566^2 + 2638449^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101101200109957 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101101200109057) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550600054978 + 50550600054979.

It is an arithmetic number, because the mean of its divisors is an integer number (50550600054979).

Almost surely, 2101101200109957 is an apocalyptic number.

It is an amenable number.

101101200109957 is a deficient number, since it is larger than the sum of its proper divisors (1).

101101200109957 is an equidigital number, since it uses as much as digits as its factorization.

101101200109957 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 5670, while the sum is 37.

The spelling of 101101200109957 in words is "one hundred one trillion, one hundred one billion, two hundred million, one hundred nine thousand, nine hundred fifty-seven".