Search a number
-
+
104654201237 is a prime number
BaseRepresentation
bin110000101110111100…
…0000110000110010101
3101000010112100021002022
41201131320012012111
53203312433414422
6120024422422525
710363300014215
oct1413570060625
9330115307068
10104654201237
1140424628403
1218348591a45
139b3ab26481
1450cb22a245
152ac7b37342
hex185de06195

104654201237 has 2 divisors, whose sum is σ = 104654201238. Its totient is φ = 104654201236.

The previous prime is 104654201129. The next prime is 104654201243. The reversal of 104654201237 is 732102456401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83906391556 + 20747809681 = 289666^2 + 144041^2 .

It is a cyclic number.

It is not a de Polignac number, because 104654201237 - 216 = 104654135701 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 104654201197 and 104654201206.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (104654201257) 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, 52327100618 + 52327100619.

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

Almost surely, 2104654201237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40320, while the sum is 35.

Adding to 104654201237 its reverse (732102456401), we get a palindrome (836756657638).

The spelling of 104654201237 in words is "one hundred four billion, six hundred fifty-four million, two hundred one thousand, two hundred thirty-seven".