Search a number
-
+
131146565 = 5112384483
BaseRepresentation
bin1111101000100…
…10001101000101
3100010202221021012
413310102031011
5232033142230
621002532005
73151504334
oct764221505
9303687235
10131146565
11680353a0
1237b07005
132122a624
14135bbd1b
15b7a8395
hex7d12345

131146565 has 8 divisors (see below), whose sum is σ = 171682848. Its totient is φ = 95379280.

The previous prime is 131146553. The next prime is 131146567. The reversal of 131146565 is 565641131.

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

It is not a de Polignac number, because 131146565 - 216 = 131081029 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2131146565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2384499.

The product of its digits is 10800, while the sum is 32.

The square root of 131146565 is about 11451.9240741458. The cubic root of 131146565 is about 508.0646436946.

Adding to 131146565 its reverse (565641131), we get a palindrome (696787696).

The spelling of 131146565 in words is "one hundred thirty-one million, one hundred forty-six thousand, five hundred sixty-five".

Divisors: 1 5 11 55 2384483 11922415 26229313 131146565