Search a number
-
+
131106931 = 163804337
BaseRepresentation
bin1111101000010…
…00100001110011
3100010200220220021
413310020201303
5232030410211
621002024311
73151250644
oct764104163
9303626807
10131106931
116800863a
1237aa8097
1321215587
14135ab6cb
15b79b771
hex7d08873

131106931 has 4 divisors (see below), whose sum is σ = 131911432. Its totient is φ = 130302432.

The previous prime is 131106929. The next prime is 131106961. The reversal of 131106931 is 139601131.

It is a happy number.

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 131106931 - 21 = 131106929 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (131106901) 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 3 ways as a sum of consecutive naturals, for example, 402006 + ... + 402331.

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

Almost surely, 2131106931 is an apocalyptic number.

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

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

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

The sum of its prime factors is 804500.

The product of its (nonzero) digits is 486, while the sum is 25.

The square root of 131106931 is about 11450.1934918149. The cubic root of 131106931 is about 508.0134575454.

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

Divisors: 1 163 804337 131106931