Search a number
-
+
1055011160117 is a prime number
BaseRepresentation
bin11110101101000111001…
…00001100000000110101
310201212011112121220110202
433112203210030000311
5114241130324110432
62124355422330245
7136136105620025
oct17264344140065
93655145556422
101055011160117
11377478328792
12150575129985
13786442a3a65
14390c4501a85
151c69b019462
hexf5a390c035

1055011160117 has 2 divisors, whose sum is σ = 1055011160118. Its totient is φ = 1055011160116.

The previous prime is 1055011160111. The next prime is 1055011160149. The reversal of 1055011160117 is 7110611105501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 933018833041 + 121992327076 = 965929^2 + 349274^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055011160117 - 28 = 1055011159861 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21055011160117 is an apocalyptic number.

It is an amenable number.

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

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

1055011160117 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1050, while the sum is 29.

Adding to 1055011160117 its reverse (7110611105501), we get a palindrome (8165622265618).

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