Search a number
-
+
1100005561 is a prime number
BaseRepresentation
bin100000110010000…
…1100000010111001
32211122212001221201
41001210030002321
54223100134221
6301052534201
736154615204
oct10144140271
92748761851
101100005561
11514a19506
12268481361
13146b83385
14a614093b
1566887891
hex4190c0b9

1100005561 has 2 divisors, whose sum is σ = 1100005562. Its totient is φ = 1100005560.

The previous prime is 1100005483. The next prime is 1100005573. The reversal of 1100005561 is 1655000011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 968765625 + 131239936 = 31125^2 + 11456^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100005561 - 27 = 1100005433 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 21100005561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 1100005561 is about 33166.3317386774. The cubic root of 1100005561 is about 1032.2818550018.

Adding to 1100005561 its reverse (1655000011), we get a palindrome (2755005572).

The spelling of 1100005561 in words is "one billion, one hundred million, five thousand, five hundred sixty-one".