Search a number
-
+
131690535 = 3529632
BaseRepresentation
bin1111101100101…
…11000000100111
3100011210120110020
413312113000213
5232203044120
621022330223
73156231264
oct766270047
9304716406
10131690535
1168377059
1238129973
132138b0c2
14136c026b
15b864640
hex7d97027

131690535 has 12 divisors (see below), whose sum is σ = 210775992. Its totient is φ = 70211248.

The previous prime is 131690527. The next prime is 131690543. The reversal of 131690535 is 535096131.

It is an interprime number because it is at equal distance from previous prime (131690527) and next prime (131690543).

It is not a de Polignac number, because 131690535 - 23 = 131690527 is a prime.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42964 + ... + 45926.

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

Almost surely, 2131690535 is an apocalyptic number.

131690535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

131690535 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 5934 (or 2971 counting only the distinct ones).

The product of its (nonzero) digits is 12150, while the sum is 33.

The square root of 131690535 is about 11475.6496548126. The cubic root of 131690535 is about 508.7661252528.

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

Divisors: 1 3 5 15 2963 8889 14815 44445 8779369 26338107 43896845 131690535