Search a number
-
+
11060571541 is a prime number
BaseRepresentation
bin10100100110100001…
…01110110110010101
31001112211102020202211
422103100232312111
5140123001242131
65025310233421
7541043210155
oct122320566625
931484366684
1011060571541
11476644a118
1221881b5871
1310736447b6
1476cd5a765
1544b0565b1
hex29342ed95

11060571541 has 2 divisors, whose sum is σ = 11060571542. Its totient is φ = 11060571540.

The previous prime is 11060571503. The next prime is 11060571547. The reversal of 11060571541 is 14517506011.

11060571541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8967143025 + 2093428516 = 94695^2 + 45754^2 .

It is a cyclic number.

It is not a de Polignac number, because 11060571541 - 211 = 11060569493 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211060571541 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 31.

The spelling of 11060571541 in words is "eleven billion, sixty million, five hundred seventy-one thousand, five hundred forty-one".