Search a number
-
+
131057695 = 567391217
BaseRepresentation
bin1111100111111…
…00100000011111
3100010121102100201
413303330200133
5232022321240
621001004331
73150654256
oct763744037
9303542321
10131057695
1167a8464a
1237a836a7
13211c9042
141359779d
15b78bd9a
hex7cfc81f

131057695 has 8 divisors (see below), whose sum is σ = 159616944. Its totient is φ = 103281024.

The previous prime is 131057683. The next prime is 131057713. The reversal of 131057695 is 596750131.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 131057695 - 211 = 131055647 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195274 + ... + 195943.

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

Almost surely, 2131057695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 391289.

The product of its (nonzero) digits is 28350, while the sum is 37.

The square root of 131057695 is about 11448.0432825876. The cubic root of 131057695 is about 507.9498563253.

The spelling of 131057695 in words is "one hundred thirty-one million, fifty-seven thousand, six hundred ninety-five".

Divisors: 1 5 67 335 391217 1956085 26211539 131057695