Search a number
-
+
130506592367 = 2916726947469
BaseRepresentation
bin111100110001011001…
…1001001000001101111
3110110212020011210201002
41321202303021001233
54114234141423432
6135542013110515
712300034506014
oct1714263110157
9413766153632
10130506592367
1150390629508
122136248843b
13c3cab27428
14646089970b
1535dc57ee62
hex1e62cc906f

130506592367 has 8 divisors (see below), whose sum is σ = 135815248800. Its totient is φ = 125251831264.

The previous prime is 130506592351. The next prime is 130506592373. The reversal of 130506592367 is 763295605031.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 130506592367 - 24 = 130506592351 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2130506592367 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26947665.

The product of its (nonzero) digits is 1020600, while the sum is 47.

The spelling of 130506592367 in words is "one hundred thirty billion, five hundred six million, five hundred ninety-two thousand, three hundred sixty-seven".

Divisors: 1 29 167 4843 26947469 781476601 4500227323 130506592367