Search a number
-
+
315045206689133 is a prime number
BaseRepresentation
bin100011110100010000010110…
…1101000100000010101101101
31112022111000202010122201100102
41013220200231220200111231
5312243200040403023013
63034013434150040445
7123234156625332164
oct10750405550402555
91468430663581312
10315045206689133
1191423a15a67708
122b401a56349125
13106a38352c259b
1457b23ab1c03db
1526650aeb3cd58
hex11e882da2056d

315045206689133 has 2 divisors, whose sum is σ = 315045206689134. Its totient is φ = 315045206689132.

The previous prime is 315045206689097. The next prime is 315045206689177. The reversal of 315045206689133 is 331986602540513.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 162570201091204 + 152475005597929 = 12750302^2 + 12348077^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 315045206689133 - 242 = 310647160178029 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2315045206689133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13996800, while the sum is 56.

The spelling of 315045206689133 in words is "three hundred fifteen trillion, forty-five billion, two hundred six million, six hundred eighty-nine thousand, one hundred thirty-three".