Search a number
-
+
110100933882937 is a prime number
BaseRepresentation
bin11001000010001011011111…
…000011011011010000111001
3112102211112202101110021220201
4121002023133003123100321
5103412343203033223222
61030055400515122201
732122346531414044
oct3102133703332071
9472745671407821
10110100933882937
11320995a8940378
121042236bba3361
13495862040ba4a
141d28cb101bc5b
15cadea091d427
hex6422df0db439

110100933882937 has 2 divisors, whose sum is σ = 110100933882938. Its totient is φ = 110100933882936.

The previous prime is 110100933882887. The next prime is 110100933882991. The reversal of 110100933882937 is 739288339001011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90468803457081 + 19632130425856 = 9511509^2 + 4430816^2 .

It is a cyclic number.

It is not a de Polignac number, because 110100933882937 - 215 = 110100933850169 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110100933882937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1959552, while the sum is 55.

The spelling of 110100933882937 in words is "one hundred ten trillion, one hundred billion, nine hundred thirty-three million, eight hundred eighty-two thousand, nine hundred thirty-seven".