Search a number
-
+
20242430423213 is a prime number
BaseRepresentation
bin1001001101001000011101…
…10111111111000010101101
32122200011020210002000112012
410212210032313333002231
510123122444142020323
6111015124423251005
74156316203433435
oct446441667770255
978604223060465
1020242430423213
1164a48482891a9
12232b150ba9a65
13b3ab120638bb
144dda4b6092c5
15251843377678
hex12690edff0ad

20242430423213 has 2 divisors, whose sum is σ = 20242430423214. Its totient is φ = 20242430423212.

The previous prime is 20242430423147. The next prime is 20242430423221. The reversal of 20242430423213 is 31232403424202.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 16379075069449 + 3863355353764 = 4047107^2 + 1965542^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-20242430423213 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 220242430423213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 55296, while the sum is 32.

Adding to 20242430423213 its reverse (31232403424202), we get a palindrome (51474833847415).

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