Search a number
-
+
104761957 is a prime number
BaseRepresentation
bin1100011111010…
…00101001100101
321022010110101111
412033220221211
5203304340312
614221225021
72411314306
oct617505145
9238113344
10104761957
1154154233
122b102171
1318920131
14dcb07ad
1592e58a7
hex63e8a65

104761957 has 2 divisors, whose sum is σ = 104761958. Its totient is φ = 104761956.

The previous prime is 104761933. The next prime is 104761967. The reversal of 104761957 is 759167401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72488196 + 32273761 = 8514^2 + 5681^2 .

It is a cyclic number.

It is not a de Polignac number, because 104761957 - 27 = 104761829 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2104761957 is an apocalyptic number.

It is an amenable number.

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

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

104761957 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 52920, while the sum is 40.

The square root of 104761957 is about 10235.3288662358. The cubic root of 104761957 is about 471.4126158883.

The spelling of 104761957 in words is "one hundred four million, seven hundred sixty-one thousand, nine hundred fifty-seven".