Search a number
-
+
105500057671 is a prime number
BaseRepresentation
bin110001001000001001…
…0110010000001000111
3101002022110222012222101
41202100102302001013
53212031003321141
6120244400212531
710423250460031
oct1422022620107
9332273865871
10105500057671
1140819039908
121854390a147
139c44143738
14516b6d0c51
152b2701b531
hex18904b2047

105500057671 has 2 divisors, whose sum is σ = 105500057672. Its totient is φ = 105500057670.

The previous prime is 105500057653. The next prime is 105500057711. The reversal of 105500057671 is 176750005501.

It is a weak prime.

It is an emirp because it is prime and its reverse (176750005501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 105500057671 - 229 = 104963186759 is a prime.

It is a super-2 number, since 2×1055000576712 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 105500057671.

It is a congruent number.

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

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

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

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

Almost surely, 2105500057671 is an apocalyptic number.

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

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

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

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

The spelling of 105500057671 in words is "one hundred five billion, five hundred million, fifty-seven thousand, six hundred seventy-one".