Search a number
-
+
1056050561117 is a prime number
BaseRepresentation
bin11110101111000011000…
…01001100000001011101
310201221211222102221121002
433113201201030001131
5114300242420423432
62125050512320045
7136203626442446
oct17274141140135
93657758387532
101056050561117
11377961013082
12150805243025
137877b727c36
14391825882cd
151c70c3cee62
hexf5e184c05d

1056050561117 has 2 divisors, whose sum is σ = 1056050561118. Its totient is φ = 1056050561116.

The previous prime is 1056050561077. The next prime is 1056050561129. The reversal of 1056050561117 is 7111650506501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 741426045721 + 314624515396 = 861061^2 + 560914^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056050561117 - 228 = 1055782125661 is a prime.

It is a super-2 number, since 2×10560505611172 (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 (1056050521117) 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, 528025280558 + 528025280559.

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

Almost surely, 21056050561117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 38.

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