Search a number
-
+
173052571313 is a prime number
BaseRepresentation
bin1010000100101010111…
…1001010111010110001
3121112200022221110202002
42201022233022322301
510313402424240223
6211255501103345
715334255404656
oct2411257127261
9545608843662
10173052571313
1167433735186
1229656b57b55
131341b4b71bb
148539245c2d
15477c825e28
hex284abcaeb1

173052571313 has 2 divisors, whose sum is σ = 173052571314. Its totient is φ = 173052571312.

The previous prime is 173052571309. The next prime is 173052571327. The reversal of 173052571313 is 313175250371.

173052571313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 163210344049 + 9842227264 = 403993^2 + 99208^2 .

It is a cyclic number.

It is not a de Polignac number, because 173052571313 - 22 = 173052571309 is a prime.

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

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

Almost surely, 2173052571313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 173052571313 in words is "one hundred seventy-three billion, fifty-two million, five hundred seventy-one thousand, three hundred thirteen".