Search a number
-
+
104674857029 is a prime number
BaseRepresentation
bin110000101111100011…
…0111001000001000101
3101000011222012200111122
41201133012321001011
53203333230411104
6120030441243325
710363640414201
oct1413706710105
9330158180448
10104674857029
1140435256406
1218353493545
139b421a9232
1450cdc85b01
152ac98676be
hex185f1b9045

104674857029 has 2 divisors, whose sum is σ = 104674857030. Its totient is φ = 104674857028.

The previous prime is 104674856971. The next prime is 104674857047. The reversal of 104674857029 is 920758476401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104602436929 + 72420100 = 323423^2 + 8510^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2104674857029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3386880, while the sum is 53.

The spelling of 104674857029 in words is "one hundred four billion, six hundred seventy-four million, eight hundred fifty-seven thousand, twenty-nine".