Search a number
-
+
131106953 = 853153701
BaseRepresentation
bin1111101000010…
…00100010001001
3100010200220221002
413310020202021
5232030410303
621002024345
73151251005
oct764104211
9303626832
10131106953
116800865a
1237aa80b5
13212155a3
14135ab705
15b79b788
hex7d08889

131106953 has 4 divisors (see below), whose sum is σ = 131261508. Its totient is φ = 130952400.

The previous prime is 131106929. The next prime is 131106961. The reversal of 131106953 is 359601131.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 56595529 + 74511424 = 7523^2 + 8632^2 .

It is a cyclic number.

It is not a de Polignac number, because 131106953 - 28 = 131106697 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75998 + ... + 77703.

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

Almost surely, 2131106953 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 154554.

The product of its (nonzero) digits is 2430, while the sum is 29.

The square root of 131106953 is about 11450.1944524973. The cubic root of 131106953 is about 508.0134859606.

The spelling of 131106953 in words is "one hundred thirty-one million, one hundred six thousand, nine hundred fifty-three".

Divisors: 1 853 153701 131106953