Search a number
-
+
31513500131 is a prime number
BaseRepresentation
bin11101010110010110…
…011101100111100011
310000100020012200020112
4131112112131213203
51004014424001011
622251015401535
72163635221451
oct352626354743
9100306180215
1031513500131
1112401605093
1261359832ab
132c82b030c9
14174d4639d1
15c4693d58b
hex75659d9e3

31513500131 has 2 divisors, whose sum is σ = 31513500132. Its totient is φ = 31513500130.

The previous prime is 31513500113. The next prime is 31513500133. The reversal of 31513500131 is 13100531513.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 31513500131 - 222 = 31509305827 is a prime.

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

Together with 31513500133, 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 = 31513500097 and 31513500106.

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

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

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

Almost surely, 231513500131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 675, while the sum is 23.

The spelling of 31513500131 in words is "thirty-one billion, five hundred thirteen million, five hundred thousand, one hundred thirty-one".