Search a number
-
+
1105326309137 is a prime number
BaseRepresentation
bin10000000101011010100…
…101001111111100010001
310220200001002110022021112
4100011122211033330101
5121102202013343022
62203440242503105
7142600005415421
oct20053245177421
93820032408245
101105326309137
11396847981976
1215a277664a95
138030241699b
143b6d8a2a481
151db433b18e2
hex1015a94ff11

1105326309137 has 2 divisors, whose sum is σ = 1105326309138. Its totient is φ = 1105326309136.

The previous prime is 1105326309023. The next prime is 1105326309151. The reversal of 1105326309137 is 7319036235011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 991784941456 + 113541367681 = 995884^2 + 336959^2 .

It is a cyclic number.

It is not a de Polignac number, because 1105326309137 - 228 = 1105057873681 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1105326309094 and 1105326309103.

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

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

Almost surely, 21105326309137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1105326309137 in words is "one trillion, one hundred five billion, three hundred twenty-six million, three hundred nine thousand, one hundred thirty-seven".