Search a number
-
+
5505550505251 is a prime number
BaseRepresentation
bin101000000011101110001…
…1000011101010100100011
3201111022210021120201110021
41100013130120131110203
51210200331412132001
615413114234214311
71105522450103536
oct120073430352443
921438707521407
105505550505251
111832988804785
1274b019884397
1330c22c12a074
14150681c0ca1d
159832a79dba1
hex501dc61d523

5505550505251 has 2 divisors, whose sum is σ = 5505550505252. Its totient is φ = 5505550505250.

The previous prime is 5505550505249. The next prime is 5505550505269. The reversal of 5505550505251 is 1525050555055.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5505550505251 - 21 = 5505550505249 is a prime.

It is a super-2 number, since 2×55055505052512 (a number of 26 digits) contains 22 as substring.

Together with 5505550505249, it forms a pair of twin primes.

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

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

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

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

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

Almost surely, 25505550505251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 781250, while the sum is 43.

The spelling of 5505550505251 in words is "five trillion, five hundred five billion, five hundred fifty million, five hundred five thousand, two hundred fifty-one".