Search a number
-
+
131510131 is a prime number
BaseRepresentation
bin1111101011010…
…10111101110011
3100011110101222121
413311222331303
5232131311011
621014415111
73154550314
oct765527563
9304411877
10131510131
1168263565
1238061497
1321326c5c
141367460b
15b82ae71
hex7d6af73

131510131 has 2 divisors, whose sum is σ = 131510132. Its totient is φ = 131510130.

The previous prime is 131510129. The next prime is 131510143. The reversal of 131510131 is 131015131.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 131510131 - 21 = 131510129 is a prime.

It is a super-2 number, since 2×1315101312 = 34589829111274322, which contains 22 as substring.

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

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

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

Almost surely, 2131510131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 45, while the sum is 16.

The square root of 131510131 is about 11467.7866652637. The cubic root of 131510131 is about 508.5336980511.

Adding to 131510131 its reverse (131015131), we get a palindrome (262525262).

The spelling of 131510131 in words is "one hundred thirty-one million, five hundred ten thousand, one hundred thirty-one".