Search a number
-
+
31152566033 is a prime number
BaseRepresentation
bin11101000000110101…
…100110111100010001
32222102002001022201222
4131000311212330101
51002300024103113
622151123334425
72151663304451
oct350065467421
988362038658
1031152566033
11122368a1a46
126054b21415
132c260bc134
14171754bd61
15c24de4e08
hex740d66f11

31152566033 has 2 divisors, whose sum is σ = 31152566034. Its totient is φ = 31152566032.

The previous prime is 31152565933. The next prime is 31152566047. The reversal of 31152566033 is 33066525113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19680442369 + 11472123664 = 140287^2 + 107108^2 .

It is a cyclic number.

It is not a de Polignac number, because 31152566033 - 210 = 31152565009 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 231152566033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 31152566033 in words is "thirty-one billion, one hundred fifty-two million, five hundred sixty-six thousand, thirty-three".