Search a number
-
+
1109996026897 is a prime number
BaseRepresentation
bin10000001001110000111…
…010110011110000010001
310221010002112100112210011
4100021300322303300101
5121141232440330042
62205531455034521
7143123510361052
oct20116072636021
93833075315704
101109996026897
11398823901a4a
1215b15b50ba41
1380897a041a4
143ba1ccb4729
151dd18326a17
hex10270eb3c11

1109996026897 has 2 divisors, whose sum is σ = 1109996026898. Its totient is φ = 1109996026896.

The previous prime is 1109996026891. The next prime is 1109996026969. The reversal of 1109996026897 is 7986206999011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1056062467201 + 53933559696 = 1027649^2 + 232236^2 .

It is an emirp because it is prime and its reverse (7986206999011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1109996026897 - 23 = 1109996026889 is a prime.

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

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

Almost surely, 21109996026897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26453952, while the sum is 67.

The spelling of 1109996026897 in words is "one trillion, one hundred nine billion, nine hundred ninety-six million, twenty-six thousand, eight hundred ninety-seven".