Search a number
-
+
32500325537 is a prime number
BaseRepresentation
bin11110010001001010…
…111001110010100001
310002220000002121012122
4132101022321302201
51013030040404122
622532550434025
72230250131451
oct362112716241
9102800077178
1032500325537
111286864a679
126370362915
1330ac3a9774
141804541d61
15ca33bb142
hex7912b9ca1

32500325537 has 2 divisors, whose sum is σ = 32500325538. Its totient is φ = 32500325536.

The previous prime is 32500325527. The next prime is 32500325573. The reversal of 32500325537 is 73552300523.

Together with next prime (32500325573) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31221476416 + 1278849121 = 176696^2 + 35761^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-32500325537 is a prime.

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

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

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

Almost surely, 232500325537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 94500, while the sum is 35.

The spelling of 32500325537 in words is "thirty-two billion, five hundred million, three hundred twenty-five thousand, five hundred thirty-seven".