Search a number
-
+
104603137 is a prime number
BaseRepresentation
bin1100011110000…
…01111000000001
321021211101112021
412033001320001
5203234300022
614214001441
72410053262
oct617017001
9237741467
10104603137
1154055981
122b046281
1318895a62
14dc6c969
1592b37c7
hex63c1e01

104603137 has 2 divisors, whose sum is σ = 104603138. Its totient is φ = 104603136.

The previous prime is 104603129. The next prime is 104603141. The reversal of 104603137 is 731306401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104223681 + 379456 = 10209^2 + 616^2 .

It is a cyclic number.

It is not a de Polignac number, because 104603137 - 23 = 104603129 is a prime.

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

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

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

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

Almost surely, 2104603137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 25.

The square root of 104603137 is about 10227.5675016105. The cubic root of 104603137 is about 471.1742735865.

Adding to 104603137 its reverse (731306401), we get a palindrome (835909538).

The spelling of 104603137 in words is "one hundred four million, six hundred three thousand, one hundred thirty-seven".