Search a number
-
+
1101109075169 is a prime number
BaseRepresentation
bin10000000001011111001…
…101110001110011100001
310220021011011222121211212
4100001133031301303201
5121020032410401134
62201501552515505
7142360336465565
oct20013715616341
93807134877755
101101109075169
11394a83404644
1215949b24bb95
137caac7b587c
143b4188c96a5
151d99802abce
hex1005f371ce1

1101109075169 has 2 divisors, whose sum is σ = 1101109075170. Its totient is φ = 1101109075168.

The previous prime is 1101109075159. The next prime is 1101109075181. The reversal of 1101109075169 is 9615709011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1099520016400 + 1589058769 = 1048580^2 + 39863^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101109075169 - 28 = 1101109074913 is a prime.

It is a super-2 number, since 2×11011090751692 (a number of 25 digits) contains 22 as substring.

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

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

Almost surely, 21101109075169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 41.

The spelling of 1101109075169 in words is "one trillion, one hundred one billion, one hundred nine million, seventy-five thousand, one hundred sixty-nine".