Search a number
-
+
1105607071 is a prime number
BaseRepresentation
bin100000111100110…
…0011100110011111
32212001101122210001
41001321203212133
54231013411241
6301412555131
736253335142
oct10171434637
92761348701
101105607071
115180a4a58
1226a322aa7
13148094b8a
14a6b9c059
15670e2431
hex41e6399f

1105607071 has 2 divisors, whose sum is σ = 1105607072. Its totient is φ = 1105607070.

The previous prime is 1105606963. The next prime is 1105607081. The reversal of 1105607071 is 1707065011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1105607071 - 217 = 1105475999 is a prime.

It is a congruent number.

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

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

Almost surely, 21105607071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1470, while the sum is 28.

The square root of 1105607071 is about 33250.6702338464. The cubic root of 1105607071 is about 1034.0311036615.

The spelling of 1105607071 in words is "one billion, one hundred five million, six hundred seven thousand, seventy-one".