Search a number
-
+
104370704037737 is a prime number
BaseRepresentation
bin10111101110110010110010…
…101111010011011101101001
3111200112202000211001112001022
4113232302302233103131221
5102140002200213201422
61005551123422502225
730661351225366604
oct2756626257233551
9450482024045038
10104370704037737
113028a404544085
12b8578a9734975
13463116600baa7
141bab7d75b533b
15c0edc5268342
hex5eecb2bd3769

104370704037737 has 2 divisors, whose sum is σ = 104370704037738. Its totient is φ = 104370704037736.

The previous prime is 104370704037637. The next prime is 104370704037767. The reversal of 104370704037737 is 737730407073401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64337547902761 + 40033156134976 = 8021069^2 + 6327176^2 .

It is a cyclic number.

It is not a de Polignac number, because 104370704037737 - 210 = 104370704036713 is a prime.

It is a super-2 number, since 2×1043707040377372 (a number of 29 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2104370704037737 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 104370704037737 in words is "one hundred four trillion, three hundred seventy billion, seven hundred four million, thirty-seven thousand, seven hundred thirty-seven".