10270671131 has 16 divisors (see below), whose sum is σ = 12015151104. Its totient is φ = 8595647424.

The previous prime is 10270671127. The next prime is 10270671139. The reversal of 10270671131 is 13117607201.

It is not a de Polignac number, because 10270671131 - 2² = 10270671127 is a prime.

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

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1334711 + ... + 1342383.

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

Almost surely, 2^10270671131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12170.

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

The spelling of 10270671131 in words is "ten billion, two hundred seventy million, six hundred seventy-one thousand, one hundred thirty-one".