Search a number
-
+
32151251981 is a prime number
BaseRepresentation
bin11101111100010111…
…010010110000001101
310001222200020211022102
4131330113102300031
51011321210030411
622434200524445
72215511063342
oct357427226015
9101880224272
1032151251981
11126a95a8532
126293480725
133054c89174
1417b00367c9
15c82916d3b
hex77c5d2c0d

32151251981 has 2 divisors, whose sum is σ = 32151251982. Its totient is φ = 32151251980.

The previous prime is 32151251947. The next prime is 32151251999. The reversal of 32151251981 is 18915215123.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 21274847881 + 10876404100 = 145859^2 + 104290^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×321512519812 (a number of 22 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 232151251981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 21600, while the sum is 38.

The spelling of 32151251981 in words is "thirty-two billion, one hundred fifty-one million, two hundred fifty-one thousand, nine hundred eighty-one".