Search a number
-
+
15550503169 is a prime number
BaseRepresentation
bin11100111101110000…
…11101100100000001
31111010202000102001211
432132320131210001
5223321412100134
611051021130121
71060233044635
oct163670354401
944122012054
1015550503169
11665a943213
12301b9b9941
13160a904586
14a773a4dc5
15610306764
hex39ee1d901

15550503169 has 2 divisors, whose sum is σ = 15550503170. Its totient is φ = 15550503168.

The previous prime is 15550503121. The next prime is 15550503193. The reversal of 15550503169 is 96130505551.

15550503169 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 can be written as a sum of positive squares in only one way, i.e., 8151922944 + 7398580225 = 90288^2 + 86015^2 .

It is a cyclic number.

It is not a de Polignac number, because 15550503169 - 213 = 15550494977 is a prime.

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

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

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

Almost surely, 215550503169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 101250, while the sum is 40.

The spelling of 15550503169 in words is "fifteen billion, five hundred fifty million, five hundred three thousand, one hundred sixty-nine".