Search a number
-
+
11572601741 is a prime number
BaseRepresentation
bin10101100011100011…
…11110001110001101
31002212111220002011022
422301301332032031
5142200041223431
65152201003525
7556531330451
oct126161761615
932774802138
1011572601741
1149a9482a78
1222ab7835a5
13112574c54c
147bad64661
1547ae9907b
hex2b1c7e38d

11572601741 has 2 divisors, whose sum is σ = 11572601742. Its totient is φ = 11572601740.

The previous prime is 11572601717. The next prime is 11572601753. The reversal of 11572601741 is 14710627511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10126396900 + 1446204841 = 100630^2 + 38029^2 .

It is a cyclic number.

It is not a de Polignac number, because 11572601741 - 210 = 11572600717 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 211572601741 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11760, while the sum is 35.

The spelling of 11572601741 in words is "eleven billion, five hundred seventy-two million, six hundred one thousand, seven hundred forty-one".