Search a number
-
+
5500500050537 is a prime number
BaseRepresentation
bin101000000001010111101…
…0110100000001001101001
3201110211202022021001000222
41100002233112200021221
51210110011003104122
615410521141335425
71105253342666012
oct120025726401151
921424668231028
105500500050537
111830826976368
1274a04a407575
1330b9059b411b
14150323176009
15981321ccb42
hex500af5a0269

5500500050537 has 2 divisors, whose sum is σ = 5500500050538. Its totient is φ = 5500500050536.

The previous prime is 5500500050501. The next prime is 5500500050567. The reversal of 5500500050537 is 7350500050055.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5494167233296 + 6332817241 = 2343964^2 + 79579^2 .

It is a cyclic number.

It is not a de Polignac number, because 5500500050537 - 26 = 5500500050473 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 5500500050497 and 5500500050506.

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

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

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

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

Almost surely, 25500500050537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 65625, while the sum is 35.

The spelling of 5500500050537 in words is "five trillion, five hundred billion, five hundred million, fifty thousand, five hundred thirty-seven".