Search a number
-
+
17115551041 is a prime number
BaseRepresentation
bin11111111000010101…
…01001010101000001
31122011210221002010211
433330022221111001
5240023040113131
611510205354121
71144065532501
oct177412512501
948153832124
1017115551041
117293311906
123397b68941
1317c9c202c4
14b8519ba01
156a28ee5b1
hex3fc2a9541

17115551041 has 2 divisors, whose sum is σ = 17115551042. Its totient is φ = 17115551040.

The previous prime is 17115551009. The next prime is 17115551051. The reversal of 17115551041 is 14015551171.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 16988515600 + 127035441 = 130340^2 + 11271^2 .

It is a cyclic number.

It is not a de Polignac number, because 17115551041 - 25 = 17115551009 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 17115550994 and 17115551012.

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

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

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

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

Almost surely, 217115551041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 17115551041 in words is "seventeen billion, one hundred fifteen million, five hundred fifty-one thousand, forty-one".