Search a number
-
+
104491303642457 is a prime number
BaseRepresentation
bin10111110000100011000111…
…000010010010010101011001
3111200222021022121111012120222
4113300203013002102111121
5102143441142213024312
61010122350414525425
731003150625203664
oct2760430702222531
9450867277435528
10104491303642457
1130326570907096
12b877146206875
13463c6454b3b44
141bb35984006db
15c130d2bae672
hex5f08c7092559

104491303642457 has 2 divisors, whose sum is σ = 104491303642458. Its totient is φ = 104491303642456.

The previous prime is 104491303642423. The next prime is 104491303642459. The reversal of 104491303642457 is 754246303194401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87118254368656 + 17373049273801 = 9333716^2 + 4168099^2 .

It is a cyclic number.

It is not a de Polignac number, because 104491303642457 - 212 = 104491303638361 is a prime.

Together with 104491303642459, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2104491303642457 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 104491303642457 in words is "one hundred four trillion, four hundred ninety-one billion, three hundred three million, six hundred forty-two thousand, four hundred fifty-seven".