Search a number
-
+
936131001131 is a prime number
BaseRepresentation
bin11011001111101011100…
…00010111101100101011
310022111022120122010001102
431213311300113230223
5110314144014014011
61554015212112015
7124430125135154
oct15476560275453
93274276563042
10936131001131
113310135aa807
1213151846560b
136a37a0c6311
1433447bc092b
151953e51873b
hexd9f5c17b2b

936131001131 has 2 divisors, whose sum is σ = 936131001132. Its totient is φ = 936131001130.

The previous prime is 936131001097. The next prime is 936131001133. The reversal of 936131001131 is 131100131639.

It is a strong prime.

It is an emirp because it is prime and its reverse (131100131639) is a distict prime.

It is a cyclic number.

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

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

Together with 936131001133, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2936131001131 is an apocalyptic number.

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

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

936131001131 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1458, while the sum is 29.

The spelling of 936131001131 in words is "nine hundred thirty-six billion, one hundred thirty-one million, one thousand, one hundred thirty-one".