Search a number
-
+
104646963277 is a prime number
BaseRepresentation
bin110000101110101110…
…0011111000001001101
3101000010000201112110201
41201131130133001031
53203304110311102
6120024003333501
710363151340253
oct1413534370115
9330100645421
10104646963277
114042053441a
1218346081291
139b39490b5c
1450ca2a45d3
152ac71a7987
hex185d71f04d

104646963277 has 2 divisors, whose sum is σ = 104646963278. Its totient is φ = 104646963276.

The previous prime is 104646963269. The next prime is 104646963301. The reversal of 104646963277 is 772369646401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103726508356 + 920454921 = 322066^2 + 30339^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 104646963277 - 23 = 104646963269 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2104646963277 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 104646963277 in words is "one hundred four billion, six hundred forty-six million, nine hundred sixty-three thousand, two hundred seventy-seven".