Search a number
-
+
130210100313617 is a prime number
BaseRepresentation
bin11101100110110011100110…
…110001100111111000010001
3122002000222000202211001210202
4131212303212301213320101
5114031330241140013432
61140533405544504545
736266240446000112
oct3546634661477021
9562028022731722
10130210100313617
1138541880069555
121272b70b17b155
1357869b52b4c9c
1424222b9876209
15100c0e45e3462
hex766ce6c67e11

130210100313617 has 2 divisors, whose sum is σ = 130210100313618. Its totient is φ = 130210100313616.

The previous prime is 130210100313541. The next prime is 130210100313691. The reversal of 130210100313617 is 716313001012031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112529748864016 + 17680351449601 = 10608004^2 + 4204801^2 .

It is a cyclic number.

It is not a de Polignac number, because 130210100313617 - 28 = 130210100313361 is a prime.

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

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

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

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

Almost surely, 2130210100313617 is an apocalyptic number.

It is an amenable number.

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

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

130210100313617 is an evil number, because the sum of its binary digits is even.

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

Adding to 130210100313617 its reverse (716313001012031), we get a palindrome (846523101325648).

The spelling of 130210100313617 in words is "one hundred thirty trillion, two hundred ten billion, one hundred million, three hundred thirteen thousand, six hundred seventeen".