Search a number
-
+
1550756021 is a prime number
BaseRepresentation
bin101110001101110…
…1010100010110101
311000002000120100012
41130123222202311
511133443143041
6413514030005
753300131403
oct13433524265
94002016305
101550756021
117263a7a51
12373418305
131b9383819
14109d56473
15912233eb
hex5c6ea8b5

1550756021 has 2 divisors, whose sum is σ = 1550756022. Its totient is φ = 1550756020.

The previous prime is 1550755993. The next prime is 1550756027. The reversal of 1550756021 is 1206570551.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1507380625 + 43375396 = 38825^2 + 6586^2 .

It is an emirp because it is prime and its reverse (1206570551) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1550756021 - 218 = 1550493877 is a prime.

It is a congruent number.

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

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

Almost surely, 21550756021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1550756021 is about 39379.6396758528. The cubic root of 1550756021 is about 1157.4826555968.

The spelling of 1550756021 in words is "one billion, five hundred fifty million, seven hundred fifty-six thousand, twenty-one".