6407013131 has 2 divisors, whose sum is σ = 6407013132. Its totient is φ = 6407013130.

The previous prime is 6407013113. The next prime is 6407013139. The reversal of 6407013131 is 1313107046.

Together with previous prime (6407013113) 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 a de Polignac number, because none of the positive numbers 2^k-6407013131 is a prime.

It is a super-2 number, since 2×6407013131² = 82099634521612846322, which contains 22 as substring.

It is a Sophie Germain prime.

It is a self number, because there is not a number n which added to its sum of digits gives 6407013131.

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

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

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

Almost surely, 2^6407013131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 26.

The square root of 6407013131 is about 80043.8200675105. The cubic root of 6407013131 is about 1857.3134540194.

The spelling of 6407013131 in words is "six billion, four hundred seven million, thirteen thousand, one hundred thirty-one".