6915131 has 4 divisors (see below), whose sum is σ = 7075992. Its totient is φ = 6754272.

The previous prime is 6915127. The next prime is 6915149. The reversal of 6915131 is 1315196.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 6915131 - 2² = 6915127 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (6915121) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80366 + ... + 80451.

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

Almost surely, 2^6915131 is an apocalyptic number.

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

6915131 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 160860.

The product of its digits is 810, while the sum is 26.

The square root of 6915131 is about 2629.6636667072. The cubic root of 6915131 is about 190.5168843521.

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