Search a number
-
+
131162046131 = 208362967857
BaseRepresentation
bin111101000100111011…
…1011111111010110011
3110112112220112022020102
41322021313133322303
54122104440434011
6140131025503015
712322213665644
oct1721167377263
9415486468212
10131162046131
1150697612636
1221505aa1a6b
13c4a386a8ac
1464c39596cb
153629da373b
hex1e89ddfeb3

131162046131 has 4 divisors (see below), whose sum is σ = 131225016072. Its totient is φ = 131099076192.

The previous prime is 131162046091. The next prime is 131162046137. The reversal of 131162046131 is 131640261131.

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

It is a cyclic number.

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

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2131162046131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 62969940.

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

The spelling of 131162046131 in words is "one hundred thirty-one billion, one hundred sixty-two million, forty-six thousand, one hundred thirty-one".

Divisors: 1 2083 62967857 131162046131