Search a number
-
+
5301415114493 is a prime number
BaseRepresentation
bin100110100100101010011…
…1101101111011011111101
3200202210212201211102022012
41031021110331233123331
51143324244232130433
615135234140301005
71055005002650651
oct115112475573375
920683781742265
105301415114493
111764354696273
12717549241765
132c5bc9134114
14144838812a61
1592d7e25d848
hex4d254f6f6fd

5301415114493 has 2 divisors, whose sum is σ = 5301415114494. Its totient is φ = 5301415114492.

The previous prime is 5301415114477. The next prime is 5301415114507. The reversal of 5301415114493 is 3944115141035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5258963457049 + 42451657444 = 2293243^2 + 206038^2 .

It is a cyclic number.

It is not a de Polignac number, because 5301415114493 - 24 = 5301415114477 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 25301415114493 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 129600, while the sum is 41.

The spelling of 5301415114493 in words is "five trillion, three hundred one billion, four hundred fifteen million, one hundred fourteen thousand, four hundred ninety-three".