Search a number
-
+
1016305111057 is a prime number
BaseRepresentation
bin11101100101000001000…
…00010101000000010001
310121011021001100212222011
432302200200111000101
5113122343102023212
62054514545342521
7133265662623655
oct16624040250021
93534231325864
101016305111057
11362015816195
12144b72637a41
1374ab631c052
1437291b1ca65
151b682e2a4a7
hexeca0815011

1016305111057 has 2 divisors, whose sum is σ = 1016305111058. Its totient is φ = 1016305111056.

The previous prime is 1016305111027. The next prime is 1016305111103. The reversal of 1016305111057 is 7501115036101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 975859476736 + 40445634321 = 987856^2 + 201111^2 .

It is a cyclic number.

It is not a de Polignac number, because 1016305111057 - 27 = 1016305110929 is a prime.

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

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

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

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

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

Almost surely, 21016305111057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1016305111057 in words is "one trillion, sixteen billion, three hundred five million, one hundred eleven thousand, fifty-seven".