Search a number
-
+
1109991614513 is a prime number
BaseRepresentation
bin10000001001110000101…
…001111110100000110001
310221010002020001101010112
4100021300221332200301
5121141230323131023
62205531220311105
7143123425023005
oct20116051764061
93833066041115
101109991614513
11398821368951
1215b159b42495
1380896b1aa02
143ba1c486705
151dd17c54478
hex10270a7e831

1109991614513 has 2 divisors, whose sum is σ = 1109991614514. Its totient is φ = 1109991614512.

The previous prime is 1109991614497. The next prime is 1109991614519. The reversal of 1109991614513 is 3154161999011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1109879106064 + 112508449 = 1053508^2 + 10607^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1109991614513 - 24 = 1109991614497 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21109991614513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 262440, while the sum is 50.

The spelling of 1109991614513 in words is "one trillion, one hundred nine billion, nine hundred ninety-one million, six hundred fourteen thousand, five hundred thirteen".