Search a number
-
+
131505131 = 3197101433
BaseRepresentation
bin1111101011010…
…01101111101011
3100011110011010102
413311221233223
5232131131011
621014340015
73154526612
oct765515753
9304404112
10131505131
116825a82a
123805a60b
13213248b4
1413672879
15b82973b
hex7d69beb

131505131 has 16 divisors (see below), whose sum is σ = 138824448. Its totient is φ = 124416000.

The previous prime is 131505119. The next prime is 131505161.

131505131 is nontrivially palindromic in base 10.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-131505131 is a prime.

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

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

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

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

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

Almost surely, 2131505131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 662.

The product of its (nonzero) digits is 225, while the sum is 20.

The square root of 131505131 is about 11467.5686612289. The cubic root of 131505131 is about 508.5272531719.

It can be divided in two parts, 13150 and 5131, that added together give a palindrome (18281).

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

Divisors: 1 31 97 101 433 3007 3131 9797 13423 42001 43733 303707 1302031 1355723 4242101 131505131