Search a number
-
+
10582751161 is a prime number
BaseRepresentation
bin10011101101100011…
…11111011110111001
31000022112022110102201
421312301333132321
5133133141014121
64510041030201
7523151620633
oct116661773671
930275273381
1010582751161
114540761644
122074185361
13cc8656c48
147256d9a53
1541e11ee91
hex276c7f7b9

10582751161 has 2 divisors, whose sum is σ = 10582751162. Its totient is φ = 10582751160.

The previous prime is 10582751149. The next prime is 10582751167. The reversal of 10582751161 is 16115728501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7988784400 + 2593966761 = 89380^2 + 50931^2 .

It is a cyclic number.

It is not a de Polignac number, because 10582751161 - 27 = 10582751033 is a prime.

It is a super-2 number, since 2×105827511612 (a number of 21 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 10582751161.

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

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

Almost surely, 210582751161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16800, while the sum is 37.

The spelling of 10582751161 in words is "ten billion, five hundred eighty-two million, seven hundred fifty-one thousand, one hundred sixty-one".