Search a number
-
+
130656064141 = 7271021176023
BaseRepresentation
bin111100110101110110…
…1010101001010001101
3110111020122102202102201
41321223231111022031
54120040423023031
6140004512521501
712303531135541
oct1715355251215
9414218382381
10130656064141
1150457a3a8a9
12213a4550291
13c422a9ca75
146476687a21
1535ea757d61
hex1e6bb5528d

130656064141 has 8 divisors (see below), whose sum is σ = 130964672384. Its totient is φ = 130347811440.

The previous prime is 130656064129. The next prime is 130656064153. The reversal of 130656064141 is 141460656031.

It is an interprime number because it is at equal distance from previous prime (130656064129) and next prime (130656064153).

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 130656064141 - 223 = 130647675533 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 130656064141.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 654256 + ... + 830278.

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

Almost surely, 2130656064141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 177771.

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

The spelling of 130656064141 in words is "one hundred thirty billion, six hundred fifty-six million, sixty-four thousand, one hundred forty-one".

Divisors: 1 727 1021 176023 742267 127968721 179719483 130656064141