Search a number
-
+
100110201109957 is a prime number
BaseRepresentation
bin10110110000110010111000…
…111110011011110111000101
3111010110102221001010221122201
4112300302320332123313011
5101110201142441004312
6552525554054554501
730041503052132143
oct2660627076336705
9433412831127581
10100110201109957
1129997552728165
12b28a03b968a31
1343b24751c840c
141aa15069c6593
15b89169390557
hex5b0cb8f9bdc5

100110201109957 has 2 divisors, whose sum is σ = 100110201109958. Its totient is φ = 100110201109956.

The previous prime is 100110201109943. The next prime is 100110201110111. The reversal of 100110201109957 is 759901102011001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64254428364996 + 35855772744961 = 8015886^2 + 5987969^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2100110201109957 is an apocalyptic number.

It is an amenable number.

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

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

100110201109957 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 100110201109957 in words is "one hundred trillion, one hundred ten billion, two hundred one million, one hundred nine thousand, nine hundred fifty-seven".