Search a number
-
+
130564689261 = 343521563087
BaseRepresentation
bin111100110011001000…
…0110000110101101101
3110111000021111102122220
41321212100300311231
54114344030024021
6135551450225553
712301341355506
oct1714620606555
9414007442586
10130564689261
11504103aa576
1221379a252b9
13c409b890a6
14646849dbad
1535e2708cc6
hex1e66430d6d

130564689261 has 4 divisors (see below), whose sum is σ = 174086252352. Its totient is φ = 87043126172.

The previous prime is 130564689197. The next prime is 130564689293. The reversal of 130564689261 is 162986465031.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 130564689261 - 26 = 130564689197 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (130564689961) 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, 21760781541 + ... + 21760781546.

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

Almost surely, 2130564689261 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 43521563090.

The product of its (nonzero) digits is 1866240, while the sum is 51.

The spelling of 130564689261 in words is "one hundred thirty billion, five hundred sixty-four million, six hundred eighty-nine thousand, two hundred sixty-one".

Divisors: 1 3 43521563087 130564689261