Search a number
-
+
245114201422613 is a prime number
BaseRepresentation
bin110111101110111000011000…
…111001111011101100010101
31012010212200121010210120000002
4313232320120321323230111
5224111422341031010423
62225151524251101045
7102425626261251455
oct6756703071735425
91163780533716002
10245114201422613
1171112392652a86
12235a8936141785
13a6a02296a0b83
14447583aa51d65
151d50eb2386228
hexdeee18e7bb15

245114201422613 has 2 divisors, whose sum is σ = 245114201422614. Its totient is φ = 245114201422612.

The previous prime is 245114201422583. The next prime is 245114201422633. The reversal of 245114201422613 is 316224102411542.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 123968583637924 + 121145617784689 = 11134118^2 + 11006617^2 .

It is a cyclic number.

It is not a de Polignac number, because 245114201422613 - 214 = 245114201406229 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 (245114201422633) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2245114201422613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 92160, while the sum is 38.

The spelling of 245114201422613 in words is "two hundred forty-five trillion, one hundred fourteen billion, two hundred one million, four hundred twenty-two thousand, six hundred thirteen".