Search a number
-
+
5171547949 is a prime number
BaseRepresentation
bin1001101000011111…
…11000111100101101
3111100102011212002221
410310033320330231
541042404013244
62213100115341
7242104301161
oct46417707455
914312155087
105171547949
112214227577
121003b35b51
13645563659
14370b98ca1
15204040784
hex1343f8f2d

5171547949 has 2 divisors, whose sum is σ = 5171547950. Its totient is φ = 5171547948.

The previous prime is 5171547923. The next prime is 5171547967. The reversal of 5171547949 is 9497451715.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5171048100 + 499849 = 71910^2 + 707^2 .

It is a cyclic number.

It is not a de Polignac number, because 5171547949 - 219 = 5171023661 is a prime.

It is a super-2 number, since 2×51715479492 = 53489816377612213202, which contains 22 as substring.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 25171547949 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1587600, while the sum is 52.

The square root of 5171547949 is about 71913.4754340242. The cubic root of 5171547949 is about 1729.3126507528.

The spelling of 5171547949 in words is "five billion, one hundred seventy-one million, five hundred forty-seven thousand, nine hundred forty-nine".