Search a number
-
+
315401243420113 is a prime number
BaseRepresentation
bin100011110110110110001001…
…1000100110110010111010001
31112100202001201221120121211021
41013231230103010312113101
5312320013221303420423
63034445155252515441
7123301662556530214
oct10755542304662721
91470661657517737
10315401243420113
1191550a09465324
122b45aa5a31bb81
13106cb29574a576
1457c57046a377b
15266e49bb3295d
hex11edb131365d1

315401243420113 has 2 divisors, whose sum is σ = 315401243420114. Its totient is φ = 315401243420112.

The previous prime is 315401243420063. The next prime is 315401243420129. The reversal of 315401243420113 is 311024342104513.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 288705906857104 + 26695336563009 = 16991348^2 + 5166753^2 .

It is a cyclic number.

It is not a de Polignac number, because 315401243420113 - 225 = 315401209865681 is a prime.

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

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

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

Almost surely, 2315401243420113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34560, while the sum is 34.

Adding to 315401243420113 its reverse (311024342104513), we get a palindrome (626425585524626).

The spelling of 315401243420113 in words is "three hundred fifteen trillion, four hundred one billion, two hundred forty-three million, four hundred twenty thousand, one hundred thirteen".