Search a number
-
+
55000050555587 is a prime number
BaseRepresentation
bin11001000000101101100100…
…11110011101101011000011
321012201221202002101212210012
430200112302132131223003
524202110100420234322
6312550401401255135
714404423345043534
oct1440266236355303
9235657662355705
1055000050555587
1116585432765825
1262034657944ab
13248c637108497
14d8203399068b
15655a26a1aae2
hex3205b279dac3

55000050555587 has 2 divisors, whose sum is σ = 55000050555588. Its totient is φ = 55000050555586.

The previous prime is 55000050555553. The next prime is 55000050555589. The reversal of 55000050555587 is 78555505000055.

55000050555587 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 55000050555587 - 210 = 55000050554563 is a prime.

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

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

It is a Chen prime.

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

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

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

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

Almost surely, 255000050555587 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4375000, while the sum is 50.

The spelling of 55000050555587 in words is "fifty-five trillion, fifty million, five hundred fifty-five thousand, five hundred eighty-seven".