Search a number
-
+
49150276781 is a prime number
BaseRepresentation
bin101101110001100101…
…011011010010101101
311200212100220202111112
4231301211123102231
51301124432324111
634325045001405
73356663313404
oct556145332255
9150770822445
1049150276781
1119932060461
1296383b3265
1348339ca718
14254394063b
151429e99e8b
hexb7195b4ad

49150276781 has 2 divisors, whose sum is σ = 49150276782. Its totient is φ = 49150276780.

The previous prime is 49150276729. The next prime is 49150276817. The reversal of 49150276781 is 18767205194.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 41114050756 + 8036226025 = 202766^2 + 89645^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 249150276781 is an apocalyptic number.

It is an amenable number.

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

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

49150276781 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 846720, while the sum is 50.

The spelling of 49150276781 in words is "forty-nine billion, one hundred fifty million, two hundred seventy-six thousand, seven hundred eighty-one".