Search a number
-
+
1105005581 is a prime number
BaseRepresentation
bin100000111011101…
…0000110000001101
32212000021002200122
41001313100300031
54230340134311
6301352034325
736245251421
oct10167206015
92760232618
101105005581
11517824059
1226a0929a5
13147c14174
14a6a82b81
15670240db
hex41dd0c0d

1105005581 has 2 divisors, whose sum is σ = 1105005582. Its totient is φ = 1105005580.

The previous prime is 1105005557. The next prime is 1105005611. The reversal of 1105005581 is 1855005011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1084384900 + 20620681 = 32930^2 + 4541^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1105005581 is a prime.

It is a super-2 number, since 2×11050055812 = 2442074668082295122, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 21105005581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1000, while the sum is 26.

The square root of 1105005581 is about 33241.6242232536. The cubic root of 1105005581 is about 1033.8435529459.

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