Search a number
-
+
1550555141 is a prime number
BaseRepresentation
bin101110001101011…
…1001100000000101
311000001122100210012
41130122321200011
511133420231031
6413505440005
753265333632
oct13432714005
94001570705
101550555141
11726280033
12373340005
131b9313265
14109d03189
15911d3b2b
hex5c6b9805

1550555141 has 2 divisors, whose sum is σ = 1550555142. Its totient is φ = 1550555140.

The previous prime is 1550555137. The next prime is 1550555197. The reversal of 1550555141 is 1415550551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1522950625 + 27604516 = 39025^2 + 5254^2 .

It is a cyclic number.

It is not a de Polignac number, because 1550555141 - 22 = 1550555137 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 21550555141 is an apocalyptic number.

It is an amenable number.

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

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

1550555141 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 12500, while the sum is 32.

The square root of 1550555141 is about 39377.0890366467. The cubic root of 1550555141 is about 1157.4326745653.

The spelling of 1550555141 in words is "one billion, five hundred fifty million, five hundred fifty-five thousand, one hundred forty-one".