Search a number
-
+
1104333320141 is a prime number
BaseRepresentation
bin10000000100011111011…
…001010010111111001101
310220120110212222020110022
4100010133121102333031
5121043133312221031
62203153531351525
7142533260224652
oct20043731227715
93816425866408
101104333320141
11396388407607
1215a03abb25a5
13801a4792a2c
143b642bc5c29
151dad611797b
hex1011f652fcd

1104333320141 has 2 divisors, whose sum is σ = 1104333320142. Its totient is φ = 1104333320140.

The previous prime is 1104333320053. The next prime is 1104333320147. The reversal of 1104333320141 is 1410233334011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 879487596100 + 224845724041 = 937810^2 + 474179^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1104333320141.

It is a congruent number.

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

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

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

Almost surely, 21104333320141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 26.

Adding to 1104333320141 its reverse (1410233334011), we get a palindrome (2514566654152).

The spelling of 1104333320141 in words is "one trillion, one hundred four billion, three hundred thirty-three million, three hundred twenty thousand, one hundred forty-one".