Search a number
-
+
130503061613 is a prime number
BaseRepresentation
bin111100110001010010…
…1101011000001101101
3110110211222112102102102
41321202211223001231
54114232240432423
6135541405304445
712266662502201
oct1714245530155
9413758472372
10130503061613
1150389637831
1221361265125
13c3ca18c322
14646021ab01
1535dc0d3c28
hex1e6296b06d

130503061613 has 2 divisors, whose sum is σ = 130503061614. Its totient is φ = 130503061612.

The previous prime is 130503061607. The next prime is 130503061639. The reversal of 130503061613 is 316160305031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 72704651044 + 57798410569 = 269638^2 + 240413^2 .

It is an emirp because it is prime and its reverse (316160305031) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 130503061613 - 24 = 130503061597 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (130503066613) 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 as a sum of consecutive naturals, namely, 65251530806 + 65251530807.

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

Almost surely, 2130503061613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 29.

Adding to 130503061613 its reverse (316160305031), we get a palindrome (446663366644).

The spelling of 130503061613 in words is "one hundred thirty billion, five hundred three million, sixty-one thousand, six hundred thirteen".