Search a number
-
+
1104536826797 is a prime number
BaseRepresentation
bin10000000100101011100…
…001100111001110101101
310220121000001220110002212
4100010223201213032231
5121044042411424142
62203230041300205
7142541311055555
oct20045341471655
93817001813085
101104536826797
11396482275128
1215a097194665
13802079a7181
143b661c3c165
151dae8e15d82
hex1012b8673ad

1104536826797 has 2 divisors, whose sum is σ = 1104536826798. Its totient is φ = 1104536826796.

The previous prime is 1104536826689. The next prime is 1104536826817. The reversal of 1104536826797 is 7976286354011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1034952190276 + 69584636521 = 1017326^2 + 263789^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1104536826797 is a prime.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅1104536826797 = 2209073653594 is not.

Almost surely, 21104536826797 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15240960, while the sum is 59.

The spelling of 1104536826797 in words is "one trillion, one hundred four billion, five hundred thirty-six million, eight hundred twenty-six thousand, seven hundred ninety-seven".