Search a number
-
+
130715115345761 is a prime number
BaseRepresentation
bin11101101110001001111100…
…000001000101011101100001
3122010211020120010200210211112
4131232021330001011131201
5114113114024012031021
61142001410041353105
736350566261642442
oct3556117401053541
9563736503623745
10130715115345761
1138716a72970911
12127b156b798795
1357c24c84257ab
14243c906b512c9
15101a30064bd5b
hex76e27c045761

130715115345761 has 2 divisors, whose sum is σ = 130715115345762. Its totient is φ = 130715115345760.

The previous prime is 130715115345673. The next prime is 130715115345769. The reversal of 130715115345761 is 167543511517031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 123204583259536 + 7510532086225 = 11099756^2 + 2740535^2 .

It is a cyclic number.

It is not a de Polignac number, because 130715115345761 - 242 = 126317068834657 is a prime.

It is not a weakly prime, because it can be changed into another prime (130715115345769) 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, 65357557672880 + 65357557672881.

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

Almost surely, 2130715115345761 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1323000, while the sum is 50.

The spelling of 130715115345761 in words is "one hundred thirty trillion, seven hundred fifteen billion, one hundred fifteen million, three hundred forty-five thousand, seven hundred sixty-one".