Search a number
-
+
1105042542469 is a prime number
BaseRepresentation
bin10000000101001001101…
…010110000111110000101
310220122022022111110120221
4100011021222300332011
5121101111342324334
62203352144424341
7142556661426355
oct20051152607605
93818268443527
101105042542469
11396711785868
1215a1b86180b1
13802886b0a08
143b6ad080b65
151db2850c8b4
hex10149ab0f85

1105042542469 has 2 divisors, whose sum is σ = 1105042542470. Its totient is φ = 1105042542468.

The previous prime is 1105042542391. The next prime is 1105042542491. The reversal of 1105042542469 is 9642452405011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 594575161569 + 510467380900 = 771087^2 + 714470^2 .

It is a cyclic number.

It is not a de Polignac number, because 1105042542469 - 217 = 1105042411397 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21105042542469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 345600, while the sum is 43.

The spelling of 1105042542469 in words is "one trillion, one hundred five billion, forty-two million, five hundred forty-two thousand, four hundred sixty-nine".