Search a number
-
+
1056050060557 is a prime number
BaseRepresentation
bin11110101111000010111…
…11010001110100001101
310201221211221111111221211
433113201133101310031
5114300242303414212
62125050453454421
7136203622256212
oct17274137216415
93657757444854
101056050060557
11377960800a98
12150805041411
137877b5b114b
1439182497b09
151c70c3319a7
hexf5e17d1d0d

1056050060557 has 2 divisors, whose sum is σ = 1056050060558. Its totient is φ = 1056050060556.

The previous prime is 1056050060539. The next prime is 1056050060561. The reversal of 1056050060557 is 7550600506501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 551248336521 + 504801724036 = 742461^2 + 710494^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 21056050060557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 157500, while the sum is 40.

The spelling of 1056050060557 in words is "one trillion, fifty-six billion, fifty million, sixty thousand, five hundred fifty-seven".