Search a number
-
+
130046720941 is a prime number
BaseRepresentation
bin111100100011101100…
…0110111101110101101
3110102200011211220201001
41321013120313232231
54112313430032231
6135424224320301
712252451614004
oct1710730675655
9412604756631
10130046720941
1150174a90285
1221254473091
13c356782567
14641978bc3b
1535b1ee1b61
hex1e47637bad

130046720941 has 2 divisors, whose sum is σ = 130046720942. Its totient is φ = 130046720940.

The previous prime is 130046720893. The next prime is 130046720977. The reversal of 130046720941 is 149027640031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129638882916 + 407838025 = 360054^2 + 20195^2 .

It is a cyclic number.

It is not a de Polignac number, because 130046720941 - 27 = 130046720813 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (130046720341) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65023360470 + 65023360471.

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

Almost surely, 2130046720941 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 130046720941 in words is "one hundred thirty billion, forty-six million, seven hundred twenty thousand, nine hundred forty-one".