Search a number
-
+
49495276937 = 157315256541
BaseRepresentation
bin101110000110001001…
…011111110110001001
311201202102002120202002
4232012021133312021
51302331242330222
634423211320345
73401352624641
oct560611376611
9151672076662
1049495276937
1119a99880157
129713a500b5
13488a322c22
1425776a9521
15144a3e7392
hexb8625fd89

49495276937 has 4 divisors (see below), whose sum is σ = 49810533636. Its totient is φ = 49180020240.

The previous prime is 49495276889. The next prime is 49495276969. The reversal of 49495276937 is 73967259494.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73967259494 = 236983629747.

It can be written as a sum of positive squares in 2 ways, for example, as 20734848016 + 28760428921 = 143996^2 + 169589^2 .

It is a cyclic number.

It is not a de Polignac number, because 49495276937 - 216 = 49495211401 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (49495276037) 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 in 3 ways as a sum of consecutive naturals, for example, 157628114 + ... + 157628427.

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

Almost surely, 249495276937 is an apocalyptic number.

It is an amenable number.

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

49495276937 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 315256698.

The product of its digits is 102876480, while the sum is 65.

The spelling of 49495276937 in words is "forty-nine billion, four hundred ninety-five million, two hundred seventy-six thousand, nine hundred thirty-seven".

Divisors: 1 157 315256541 49495276937