Search a number
-
+
131010151 = 310942139
BaseRepresentation
bin1111100111100…
…00111001100111
3100010112000010211
413303300321213
5232014311101
621000000251
73150365536
oct763607147
9303460124
10131010151
1167a51958
1237a60087
13211b04cc
141358431d
15b77cc51
hex7cf0e67

131010151 has 4 divisors (see below), whose sum is σ = 131055400. Its totient is φ = 130964904.

The previous prime is 131010133. The next prime is 131010157. The reversal of 131010151 is 151010131.

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 131010151 - 217 = 130879079 is a prime.

It is a Duffinian number.

It is a zygodrome in base 2.

It is a congruent number.

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

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 3 ways as a sum of consecutive naturals, for example, 17961 + ... + 24178.

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

Almost surely, 2131010151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 45248.

The product of its (nonzero) digits is 15, while the sum is 13.

The square root of 131010151 is about 11445.9665821633. The cubic root of 131010151 is about 507.8884256481. Note that the first 3 decimals are identical.

Adding to 131010151 its reverse (151010131), we get a palindrome (282020282).

The spelling of 131010151 in words is "one hundred thirty-one million, ten thousand, one hundred fifty-one".

Divisors: 1 3109 42139 131010151