Search a number
-
+
5047307137 is a prime number
BaseRepresentation
bin1001011001101011…
…11100101110000001
3111000202101202202101
410230311330232001
540314102312022
62152501150401
7236035255105
oct45465745601
914022352671
105047307137
112160089614
12b8a3bb401
136258b3392
1435c497905
151e819d627
hex12cd7cb81

5047307137 has 2 divisors, whose sum is σ = 5047307138. Its totient is φ = 5047307136.

The previous prime is 5047307087. The next prime is 5047307149. The reversal of 5047307137 is 7317037405.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2812286961 + 2235020176 = 53031^2 + 47276^2 .

It is a cyclic number.

It is not a de Polignac number, because 5047307137 - 211 = 5047305089 is a prime.

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

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

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

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

Almost surely, 25047307137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 61740, while the sum is 37.

The square root of 5047307137 is about 71044.4025733203. The cubic root of 5047307137 is about 1715.3519649803.

The spelling of 5047307137 in words is "five billion, forty-seven million, three hundred seven thousand, one hundred thirty-seven".