Search a number
-
+
4951515161 is a prime number
BaseRepresentation
bin1001001110010001…
…00010000000011001
3110210002011000212102
410213020202000121
540120041441121
62135200053145
7233463120155
oct44710420031
913702130772
104951515161
11211100169a
12b623041b5
1360bab4038
1434d880065
151dea7a90b
hex127222019

4951515161 has 2 divisors, whose sum is σ = 4951515162. Its totient is φ = 4951515160.

The previous prime is 4951515139. The next prime is 4951515181. The reversal of 4951515161 is 1615151594.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4369210000 + 582305161 = 66100^2 + 24131^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-4951515161 is a prime.

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

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

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

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

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

Almost surely, 24951515161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 27000, while the sum is 38.

The square root of 4951515161 is about 70367.0033538448. The cubic root of 4951515161 is about 1704.4307902324.

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