Search a number
-
+
15549327047 is a prime number
BaseRepresentation
bin11100111101100111…
…11110011011000111
31111010122210122201202
432132303332123013
5223321111431142
611050540013115
71060220046002
oct163663763307
944118718652
1015549327047
11665a20a611
12301b53119b
13160a5b2147
14a7717a539
15610173032
hex39ecfe6c7

15549327047 has 2 divisors, whose sum is σ = 15549327048. Its totient is φ = 15549327046.

The previous prime is 15549327041. The next prime is 15549327119. The reversal of 15549327047 is 74072394551.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15549327047 - 28 = 15549326791 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 215549327047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1058400, while the sum is 47.

The spelling of 15549327047 in words is "fifteen billion, five hundred forty-nine million, three hundred twenty-seven thousand, forty-seven".