Search a number
-
+
131074673131 = 638920515679
BaseRepresentation
bin111101000010010101…
…0001100100111101011
3110112022211010022000101
41322010222030213223
54121420104020011
6140114225050231
712320103224113
oct1720452144753
9415284108011
10131074673131
1150652265a46
12214a0786977
13c48b7285ac
1464b60d4043
1536223952c1
hex1e84a8c9eb

131074673131 has 4 divisors (see below), whose sum is σ = 131095195200. Its totient is φ = 131054151064.

The previous prime is 131074673123. The next prime is 131074673201. The reversal of 131074673131 is 131376470131.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131376470131 = 809162393659.

It is a cyclic number.

It is not a de Polignac number, because 131074673131 - 23 = 131074673123 is a prime.

It is a super-2 number, since 2×1310746731312 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 2131074673131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20522068.

The product of its (nonzero) digits is 31752, while the sum is 37.

The spelling of 131074673131 in words is "one hundred thirty-one billion, seventy-four million, six hundred seventy-three thousand, one hundred thirty-one".

Divisors: 1 6389 20515679 131074673131