Search a number
-
+
50550549999013 is a prime number
BaseRepresentation
bin10110111111001101101111…
…00100110110110110100101
320121222120210202002222211001
423133212313210312312211
523111210011244432023
6255302334014313301
713435104516252061
oct1337466744666645
9217876722088731
1050550549999013
111511a405695a79
125805050ab8831
132228b8655066c
14c6a93420aaa1
155c9e0857a6ad
hex2df9b7936da5

50550549999013 has 2 divisors, whose sum is σ = 50550549999014. Its totient is φ = 50550549999012.

The previous prime is 50550549998969. The next prime is 50550549999017. The reversal of 50550549999013 is 31099994505505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 42639032440449 + 7911517558564 = 6529857^2 + 2812742^2 .

It is a cyclic number.

It is not a de Polignac number, because 50550549999013 - 217 = 50550549867941 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50550549999017) 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, 25275274999506 + 25275274999507.

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

Almost surely, 250550549999013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 49207500, while the sum is 64.

The spelling of 50550549999013 in words is "fifty trillion, five hundred fifty billion, five hundred forty-nine million, nine hundred ninety-nine thousand, thirteen".