Search a number
-
+
130501051 is a prime number
BaseRepresentation
bin1111100011101…
…00100110111011
3100002120010210021
413301310212323
5231402013201
620541031311
73143145352
oct761644673
9302503707
10130501051
116773440a
1237855537
1321062875
1413490999
15b6cbea1
hex7c749bb

130501051 has 2 divisors, whose sum is σ = 130501052. Its totient is φ = 130501050.

The previous prime is 130501043. The next prime is 130501067. The reversal of 130501051 is 150105031.

It is an a-pointer prime, because the next prime (130501067) can be obtained adding 130501051 to its sum of digits (16).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 130501051 - 23 = 130501043 is a prime.

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

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

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

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

Almost surely, 2130501051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 75, while the sum is 16.

The square root of 130501051 is about 11423.7056597236. The cubic root of 130501051 is about 507.2296938729.

Adding to 130501051 its reverse (150105031), we get a palindrome (280606082).

The spelling of 130501051 in words is "one hundred thirty million, five hundred one thousand, fifty-one".