Search a number
-
+
10013115113657 is a prime number
BaseRepresentation
bin1001000110110101110000…
…1010110110000010111001
31022110020121012122001112122
42101231130022312002321
52303023324432114112
633143543411251025
72052265220102255
oct221553412660271
938406535561478
1010013115113657
1132105a1493027
121158737ba9a75
13578304332cc6
142688ccca1265
151256e6532872
hex91b5c2b60b9

10013115113657 has 2 divisors, whose sum is σ = 10013115113658. Its totient is φ = 10013115113656.

The previous prime is 10013115113597. The next prime is 10013115113699. The reversal of 10013115113657 is 75631151131001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5480861583376 + 4532253530281 = 2341124^2 + 2128909^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10013115113657 - 212 = 10013115109561 is a prime.

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

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

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

Almost surely, 210013115113657 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 35.

Adding to 10013115113657 its reverse (75631151131001), we get a palindrome (85644266244658).

The spelling of 10013115113657 in words is "ten trillion, thirteen billion, one hundred fifteen million, one hundred thirteen thousand, six hundred fifty-seven".