Search a number
-
+
1101110413121 is a prime number
BaseRepresentation
bin10000000001011111010…
…010111000011101000001
310220021011021111121011122
4100001133102320131001
5121020033231204441
62201502041322025
7142360354040405
oct20013722703501
93807137447148
101101110413121
11394a84138894
1215949b796315
137caacb63864
143b418b57105
151d9981e234b
hex1005f4b8741

1101110413121 has 2 divisors, whose sum is σ = 1101110413122. Its totient is φ = 1101110413120.

The previous prime is 1101110413079. The next prime is 1101110413153. The reversal of 1101110413121 is 1213140111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 727378708225 + 373731704896 = 852865^2 + 611336^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101110413121 - 230 = 1100036671297 is a prime.

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

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

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

Almost surely, 21101110413121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 17.

Adding to 1101110413121 its reverse (1213140111011), we get a palindrome (2314250524132).

The spelling of 1101110413121 in words is "one trillion, one hundred one billion, one hundred ten million, four hundred thirteen thousand, one hundred twenty-one".