Search a number
-
+
15550117031 is a prime number
BaseRepresentation
bin11100111101101101…
…11111010010100111
31111010201021210101102
432132312333102213
5223321312221111
611051004550315
71060226546111
oct163666772247
944121253342
1015550117031
11665a6aa099
12301b85239b
13160a7ca8a7
14a773043b1
1561027c13b
hex39edbf4a7

15550117031 has 2 divisors, whose sum is σ = 15550117032. Its totient is φ = 15550117030.

The previous prime is 15550117013. The next prime is 15550117087. The reversal of 15550117031 is 13071105551.

Together with previous prime (15550117013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15550117031 - 214 = 15550100647 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 215550117031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2625, while the sum is 29.

The spelling of 15550117031 in words is "fifteen billion, five hundred fifty million, one hundred seventeen thousand, thirty-one".