Search a number
-
+
50102254115393 is a prime number
BaseRepresentation
bin10110110010001010101110…
…00011110001101001000001
320120101201200020022112101212
423121011113003301221001
523031333404023143033
6254320354025535505
713360524364153454
oct1331052703615101
9216351606275355
1050102254115393
1114a67279315477
12575219b644595
1321c58122306bc
14c52d67b9149b
155bd41bc05748
hex2d91570f1a41

50102254115393 has 2 divisors, whose sum is σ = 50102254115394. Its totient is φ = 50102254115392.

The previous prime is 50102254115387. The next prime is 50102254115411. The reversal of 50102254115393 is 39351145220105.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 49869753669904 + 232500445489 = 7061852^2 + 482183^2 .

It is a cyclic number.

It is not a de Polignac number, because 50102254115393 - 228 = 50101985679937 is a prime.

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

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

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

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

Almost surely, 250102254115393 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 50102254115393 its reverse (39351145220105), we get a palindrome (89453399335498).

The spelling of 50102254115393 in words is "fifty trillion, one hundred two billion, two hundred fifty-four million, one hundred fifteen thousand, three hundred ninety-three".