Search a number
-
+
1017455571133 is a prime number
BaseRepresentation
bin11101100111001010001…
…00111111000010111101
310121021020020011022111121
432303211010333002331
5113132222111234013
62055225043550541
7133336332441661
oct16634504770275
93537206138447
101017455571133
11362556165941
1214523398b451
1374c3a789661
14373608348a1
151b6ede2c58d
hexece513f0bd

1017455571133 has 2 divisors, whose sum is σ = 1017455571134. Its totient is φ = 1017455571132.

The previous prime is 1017455571113. The next prime is 1017455571157. The reversal of 1017455571133 is 3311755547101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 760003855524 + 257451715609 = 871782^2 + 507397^2 .

It is a cyclic number.

It is not a de Polignac number, because 1017455571133 - 25 = 1017455571101 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21017455571133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 220500, while the sum is 43.

The spelling of 1017455571133 in words is "one trillion, seventeen billion, four hundred fifty-five million, five hundred seventy-one thousand, one hundred thirty-three".