Search a number
-
+
1101509957 is a prime number
BaseRepresentation
bin100000110100111…
…1011010101000101
32211202200111121002
41001221323111011
54223441304312
6301145103045
736203452202
oct10151732505
92752614532
101101509957
11515856809
12268a87a85
1314728c052
14a6412ca9
1566a834c2
hex41a7b545

1101509957 has 2 divisors, whose sum is σ = 1101509958. Its totient is φ = 1101509956.

The previous prime is 1101509911. The next prime is 1101509993. The reversal of 1101509957 is 7599051011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1005587521 + 95922436 = 31711^2 + 9794^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101509957 - 230 = 27768133 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1101509557) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550754978 + 550754979.

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

Almost surely, 21101509957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14175, while the sum is 38.

The square root of 1101509957 is about 33189.0035553947. The cubic root of 1101509957 is about 1032.7522324040.

The spelling of 1101509957 in words is "one billion, one hundred one million, five hundred nine thousand, nine hundred fifty-seven".